A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure

Farhad M.E. Raiszadeh Department of Management, School of Business Administration, University of Tennessee at Chattanooga, Chattanooga, Tennessee, 37403, U.S.A.

P. Dileepan Department of Management, School of Business Administration, University of Tennessee at Chattanooga, Chattanooga, Tennessee, 37403, U.S.A.

Tapan Sen Department of Management, School of Business Administration, University of Tennessee at Chattanooga, Chattanooga, Tennessee, 37403, U.S.A.

Abstract

This paper considers a bicritcrion scheduling problem with n jobs to be sequenced on a single machine. The objective function to be minimized is a linear Combination of range of lateness and maximum lateness. A branch-and-bound solution procedure is presented for the problem. Computational results are also reported.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure

Abstract

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date