Two-machine flowshop scheduling with consecutive availability constraints

From MaRDI portal
Publication:1606963

DOI10.1016/S0020-0190(99)00094-0zbMath0994.90066OpenAlexW2001570418MaRDI QIDQ1606963

Guoqing Wang, Cheng, T. C. Edwin

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00094-0




Related Items (16)

Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraintHeuristics for two-machine flowshop scheduling with setup times and an availability constraintAn improved approximation algorithm for two-machine flow shop scheduling with an availability constraintSingle-machine scheduling with periodic maintenance to minimize makespan revisitedApproximation results for flow shop scheduling problems with machine availability constraintsA polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraintTwo-machine open shop scheduling with an availability constraintApproximation results for the two-machine job shop under limited machine availabilityMakespan minimization for two parallel machines scheduling with a periodic availability constraintA (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraintsStability of Johnson's schedule with respect to limited machine availabilityA note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespanAn improved heuristic for two-machine flowshop scheduling with an availability constraintOptimal online algorithm for scheduling on two identical machines with machine availability constraints.Heuristics for two-machine no-wait flowshop scheduling with an availability constraintComplexity and algorithms for two-stage flexible flowshop scheduling with availability constraints




This page was built for publication: Two-machine flowshop scheduling with consecutive availability constraints