by Gupta, J.N.D., Lauff, V., Werner, F..
Series: 1999-33, Preprints
We consider a two-machine flow shop problem with a common due date where the objective is to minimize an arbitrary function of a weighted sum of penalties assigned to early and 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. Finally, the performance of the proposed algorithm is empirically evaluated.
scheduling, flow shop non-regular criterion, enumerative algorithm, branch and bound
This paper was published in:
Journal of Mathematical Mo