Batch scheduling to minimize maximum lateness
Date
1997
Authors
Ghosh, J. B.
Gupta, J. N. D.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
1
views
views
20
downloads
downloads
Citation Stats
Series
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.
Source Title
Operations Research Letters
Publisher
Elsevier
Course
Other identifiers
Book Title
Keywords
Analysis of algorithms, Dynamic programming, Production, Scheduling
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Collections
Language
English