Batch scheduling to minimize maximum lateness
Date
1997Source Title
Operations Research Letters
Print ISSN
0167-6377
Publisher
Elsevier
Volume
21
Issue
2
Pages
77 - 80
Language
English
Type
ArticleItem Usage Stats
176
views
views
246
downloads
downloads
Abstract
We address the single-machine batch scheduling problem which arises when there are job families and setup
requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, we give
an improved dynamic program for the solution of the problem.