Minimizing maximum lateness with job families

DOI10.1016/S0377-2217(99)00328-8zbMath0991.90064OpenAlexW2043097048MaRDI QIDQ1590808

Kenneth R. Baker, Michael J. Magazine

Publication date: 21 December 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00328-8

zbMATH Keywords

scheduling jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness, ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness, Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times, A survey of scheduling problems with setup times or costs, Approximation algorithms for problems in scheduling with set-ups, An online algorithm for a problem in scheduling with set-ups and release times, A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups, Minimizing L _max for the single machine scheduling problem with family set-ups, A simulated annealing algorithm for single machine scheduling problems with family setups, Scheduling with families of jobs and delivery coordination under job availability

Cites Work

• Unnamed Item
• Batch scheduling to minimize maximum lateness
• Single machine scheduling with batch set-up times to minimize maximum lateness
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• On the Complexity of Scheduling with Batch Setup Times
• Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
• Scheduling Groups of Jobs on a Single Machine