A comparison of solution procedures for two-machine flow shop scheduling with late work criterion

Authors:
Jacek Blazewicz;Erwin Pesch;Malgorzata Sterna;Frank Werner
Affiliations:
Institute of Computing Science, Poznan University of Technology, Piotrowo, Poznan, Poland;Institute of Information Systems, Faculty of Economics, University of Siegen, Hoelderlinstrasse, Siegen, Germany;Institute of Computing Science, Poznan University of Technology, Piotrowo, Poznan, Poland;Faculty of Mathematics, Otto-von-Guericke-University, PSF, Magdeburg, Germany
Venue:
Computers and Industrial Engineering
Year:
2005

Citing 7
Cited 1

Minimizing mean weighted execution time loss on identical and uniform processors

Information Processing Letters
Algorithms for scheduling imprecise computations with timing constraints

SIAM Journal on Computing
Single machine scheduling to minimize total late work

Operations Research
Minimizing maximum weighted error for imprecise computation tasks

Journal of Algorithms
Scheduling Algorithms

Scheduling Algorithms
Scheduling Computer and Manufacturing Processes

Scheduling Computer and Manufacturing Processes
Open shop scheduling problems with late work criteria

Discrete Applied Mathematics

Late work minimization in a small flexible manufacturing system

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we analyze different solution procedures for the two-machine flow shop scheduling problem with a common due date and weighted late work criterion, i.e. for problem F2|dj = d|Yw, which is known to be binary NP-hard. In computational experiments we compare the practical efficiency of a dynamic programming approach, an enumerative method and a heuristic list scheduling procedure. Test results show that each solution method has its advantages and none of them can be rejected from consideration a priori.