6
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness

&
Pages 267-277 | Received 01 Jun 1993, Published online: 18 Jun 2013
 

Abstract

This paper considers a bicriterion scheduling problem in which a linear combination of two objective functions is considered. The weights are used to represent the relative importance of the two criteria, i.e., squared flowtime and maximum tardiness. A branch-and-bound solution procedure is designed for the problem, and a numerical example is provided to illustrate the procedure.

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:

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:

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.