Model formulations for the machine scheduling problem with limited waiting time constraints

DOI10.1080/02522667.2006.10699688zbMath1179.90131OpenAlexW2152924655MaRDI QIDQ3429070

Jen-Shiang Chen, Jin-Shang Yang

Publication date: 30 March 2007

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

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

zbMATH Keywords

integer programmingschedulingflow-shopopen-shop, job-shopuniting time

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Job scheduling of diffusion furnaces in semiconductor fabrication facilities

Cites Work

• Unnamed Item
• Inapproximability results for no-wait job shop scheduling.
• Scheduling two-machine no-wait open shops to minimize makespan
• Mathematical programming formulations for machine scheduling: A survey
• Approximative procedures for no-wait job shop scheduling.
• No-wait or no-idle permutation flowshop scheduling with dominating machines
• Two-machine flow shop scheduling problems with no-wait jobs
• A study of integer programming formulations for scheduling problems

This page was built for publication: Model formulations for the machine scheduling problem with limited waiting time constraints