[HTML][HTML] Minimizing maximum lateness with job families
KR Baker, MJ Magazine - European Journal of Operational Research, 2000 - Elsevier
European Journal of Operational Research, 2000•Elsevier
This paper examines an optimal solution procedure for scheduling jobs on a single machine
to minimize the maximum lateness in the presence of setup times between different job
families. We exploit special structure to compress the effective problem size by creating
composite jobs; then we accelerate the enumeration with dominance properties and lower
bounds. Our computational evaluation highlights the size of setup times and the variation in
due dates.
to minimize the maximum lateness in the presence of setup times between different job
families. We exploit special structure to compress the effective problem size by creating
composite jobs; then we accelerate the enumeration with dominance properties and lower
bounds. Our computational evaluation highlights the size of setup times and the variation in
due dates.
This paper examines an optimal solution procedure for scheduling jobs on a single machine to minimize the maximum lateness in the presence of setup times between different job families. We exploit special structure to compress the effective problem size by creating composite jobs; then we accelerate the enumeration with dominance properties and lower bounds. Our computational evaluation highlights the size of setup times and the variation in due dates.
Elsevier
Showing the best result for this search. See all results