Two-machine flow shop problems with availability constraints

MaRDI QIDQ2887149zbMATH OpenFDO

Authors Ming Yang, Xiwen Lu

Publication date 1 June 2012

Published in Operations Research Transactions (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmschedulingcompetitive ratioflow shopavailability constraint

Mathematics Subject Classification ID

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

Recommendations

• Approximation results for flow shop scheduling problems with machine availability constraints
• Two-machine flowshop scheduling with consecutive availability constraints
• Two-machine flowshop scheduling with availability constraints
• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
• An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs

Cited in

(21)

• Two-machine flowshop scheduling with consecutive availability constraints
• Approximation results for flow shop scheduling problems with machine availability constraints
• Minimizing the makespan for the flow shop scheduling problem with availability constraints.
• Two-machine flow shops with limited machine availability
• A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection
• Two-machine scheduling with periodic availability constraints to minimize makespan
• Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
• Scheduling two-stage hybrid flow shop with availability constraints
• A two-stage flow shop scheduling with a critical machine and batch availability
• An improved algorithm for the two machine flow shop problem with several availability constraints
• Average cost optimality for an unreliable two-machine flowshop with limited internal buffer
• Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
• Two-machine flow shop scheduling with an operator non-availability period to minimize makespan
• A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
• On-line and semi-online scheduling for flow shop problems on two machines
• Scheduling with availability constraints
• The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis
• Approximation results for the two-machine job shop under limited machine availability
• An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
• Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
• Variants of the two machine flow shop problem connected with factorization of matrix functions

This page was built for publication: Two-machine flow shop problems with availability constraints

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