Multi-family scheduling in a two-machine reentrant flow shop with setups

DOI10.1016/J.EJOR.2006.06.065MaRDI QIDQ2467261zbMATH OpenOpenAlexFDO

Authors Dar-Li Yang, Wen-Hung Kuo, Maw-Sheng Chern

Publication date 21 January 2008

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

Full work available at URL https://doi.org/10.1016/j.ejor.2006.06.065

zbMATH Keywords

schedulingNP-hardsetup timebranch-and-boundreentrant production flows

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing makespan on a two-machine re-entrant flowshop
• Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
• Heuristic algorithms for two machine re-entrant flow shop
• Minimizing total tardiness on a two-machine re-entrant flowshop
• Minimizing makespan on an \(m\)-machine re-entrant flowshop

Cites work

• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A heuristic algorithm for two-machine re-entrant shop scheduling
• A survey of scheduling problems with setup times or costs
• Minimizing Makespan in a Class of Reentrant Shops
• Minimizing makespan in re-entrant permutation flow-shops
• OPTIMAL SCHEDULE IN A GT-TYPE FLOW-SHOP UNDER SERIES-PARALLEL PRECEDENCE CONSTRAINTS
• On general routing problems
• Optimal two- and three-stage production schedules with set-up time included
• Sequencing \(n\) jobs on two machines with arbitrary time lags
• Sequency on two and three machines with setup, processing and removal times separated
• Two- and three-machine flow shop scheduling problems with equal sized transfer batches
• Two-machine flowshop group scheduling problem
• V-shop scheduling

Cited in

(10)

• Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem
• New multi-objective method to solve reentrant hybrid flow shop scheduling problem
• A review of re-entrant scheduling problems
• Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
• A comprehensive review of flowshop group scheduling literature
• Solution strategies for multi-stage wafer probing scheduling problem with reentry
• Minimizing total tardiness on a two-machine re-entrant flowshop
• Minimizing total completion time for re-entrant flow shop scheduling problems
• An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem
• Flow shops with reentry: reversibility properties and makespan optimal schedules

This page was built for publication: Multi-family scheduling in a two-machine reentrant flow shop with setups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467261)