A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem |
| |
Authors: | Tapan Sen Sushil K Gupta |
| |
Affiliation: |
a Department of Business Administration, University of North Carolina, Greensboro, North Carolina |
| |
Abstract: | Most scheduling research is done with one criterion; however, the real-world situations demand consideration of multicriterion problems because there are generally many costs associated with scheduling decisions. This paper considers the problem of minimizing a linear combination of flow times and max-mum tardiness of a given number of jobs on a single machine and presents a branch-and-bound technique to arrive at an optimal solution. The computational results are also reported. |
| |
Keywords: | |
本文献已被 InformaWorld 等数据库收录! |
|