| Article ID: | iaor20023582 |
| Country: | United States |
| Volume: | 32 |
| Issue: | 3 |
| Start Page Number: | 365 |
| End Page Number: | 373 |
| Publication Date: | Mar 2001 |
| Journal: | International Journal of Systems Science |
| Authors: | Lee W.C., Wu C.C. |
This paper is concerned with the two-criteria problem in a two-machine flow shop. The objective was to find a job sequence that minimized both the total flow time and the tardiness. Several dominant properties for the precedence relationship between jobs are proposed and a lower bound on the flow time and tardiness value for a subproblem is derived. The computational results of a branch-and-bound algorithm are also reported.