Single machine scheduling with two job classes : minimizing maximum lateness

DOI10.1080/02522667.2000.10699460zbMath1027.90036OpenAlexW2320362409MaRDI QIDQ2764975

Parthasarati Dileepan

Publication date: 14 January 2004

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.2000.10699460

zbMATH Keywords

machine scheduling problembramch-and-bound procedure

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Single facility multi-class job scheduling
• Optimal schedules for single facility with two job classes
• Single facility scheduling with multiple job classes
• Scheduling two job classes on a single machine
• Low-complexity algorithms for sequencing jobs with a fixed number of job-classes

This page was built for publication: Single machine scheduling with two job classes : minimizing maximum lateness