Minimizing maximum tardiness in single FMS machine scheduling with tool changes

DOI10.1080/02522667.2009.10699934zbMath1190.90071OpenAlexW2080143563MaRDI QIDQ5188152

Yu-Ko Chung, Kai-Yung Lin

Publication date: 10 March 2010

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

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

zbMATH Keywords

availability constraintsFMS

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling with tool changes to minimize total completion time: Basic results and SPT performance
• Machine scheduling with availability constraints
• Scheduling preemptable tasks on parallel processors with limited availability
• Single-machine scheduling with periodic maintenance and nonresumable jobs.
• Scheduling with limited machine availability
• Machine scheduling with an availability constraint
• Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance

This page was built for publication: Minimizing maximum tardiness in single FMS machine scheduling with tool changes