Two-machine flowshop scheduling to minimize the number of tardy jobs

Two-machine flowshop scheduling to minimize the number of tardy jobs

0.00 Avg rating0 Votes
Article ID: iaor1998177
Country: United Kingdom
Volume: 48
Issue: 2
Start Page Number: 212
End Page Number: 220
Publication Date: Feb 1997
Journal: Journal of the Operational Research Society
Authors: ,
Abstract:

The authors consider the two-machine flowshop problem with the objective of minimizing the total number of tardy jobs. Since this problem is known to be strongly NP-hard, algorithms are described for four polynomially solvable special cases. In addition, several heuristic algorithms are developed to find optimal or near optimal schedules. Results of computational tests in solving problems up to 60 jobs are reported and directions for future research are provided.

Reviews

Required fields are marked *. Your email address will not be published.