A two-machine flowshop scheduling problem with a separated maintenance constraint

DOI10.1016/j.cor.2006.04.007zbMath1278.90176OpenAlexW2069625430MaRDI QIDQ2456646

Wen-Hung Kuo, Chou-Jung Hsu, Dar-Li Yang

Publication date: 19 October 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.04.007

zbMATH Keywords

heuristic algorithmmaintenanceflowshop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items

Minimizing total completion time on a single machine with a flexible maintenance activity, Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown, Two-machine flow shop scheduling integrated with preventive maintenance planning, Scheduling a maintenance activity and due-window assignment on a single machine, Scheduling a maintenance activity to minimize total weighted completion-time, Production, maintenance and resource scheduling: a review

Cites Work

• Unnamed Item
• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
• Scheduling in stochastic flowshops with independent setup, processing and removal times
• Optimal two- and three-stage production schedules with setup times included
• Sequency on two and three machines with setup, processing and removal times separated
• TWO-AND THREE-MACHINE FLOW-SHOP MAKESPAN SCHEDULING PROBLEMS WITH ADDITIONAL TIMES SEPARATED FROM PROCESSING TIMES
• Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns