Two-Machine Flow Shop Scheduling with Nonregular Criteria |
| |
Authors: | Jatinder N D Gupta Volker Lauff Frank Werner |
| |
Institution: | (1) University of Alabama in Huntsville, Huntsville, AL 35899, USA;(2) Otto-von-Guericke-Universität, Fakultät für Mathematik, PSF 4120, 39016 Magdeburg, Germany |
| |
Abstract: | 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. |
| |
Keywords: | scheduling flow shop non-regular criterion enumerative algorithm branch and bound common due date |
本文献已被 SpringerLink 等数据库收录! |
|