| Article ID: | iaor2005517 |
| Country: | Netherlands |
| Volume: | 3 |
| Issue: | 2 |
| Start Page Number: | 123 |
| End Page Number: | 151 |
| Publication Date: | Apr 2004 |
| Journal: | Journal of Mathematical Modelling and Algorithms |
| Authors: | Gupta Jatinder N.D., Werner Frank, Lauff Volker |
| Keywords: | programming: branch and bound |
We consider a two-machine flow shop problem with a common due date where the objective is to minimize the sum of functions which penalize early as well as tardy completion of jobs. Since the problem is NP-hard in the strong sense, we investigate some general properties of optimal schedules for the problem, we develop lower and upper bounds, derive dominance criteria, and propose an enumerative algorithm for finding an optimal schedule. The performance of the proposed algorithm together with the influence of the individual components is thoroughly discussed.