Heuristics for two-machine no-wait flowshop scheduling with an availability constraint

DOI10.1016/S0020-0190(01)00181-8zbMath0999.90017OpenAlexW1971219265MaRDI QIDQ1607139

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(01)00181-8

Mathematics Subject Classification ID

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

Related Items

A note on minimizing maximum lateness in a two-machine no-wait flowshop, A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints, Approximability of two-machine no-wait flowshop scheduling with availability constraints., A survey of scheduling problems with no-wait in process, Makespan minimization for two parallel machines scheduling with a periodic availability constraint, Two-machine scheduling with periodic availability constraints to minimize makespan, A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan, \(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints

Cites Work

• Machine scheduling with availability constraints
• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
• Current trends in deterministic scheduling
• An improved heuristic for two-machine flowshop scheduling with an availability constraint
• Two-machine flowshop scheduling with consecutive availability constraints
• Scheduling with limited machine availability
• Machine scheduling with an availability constraint
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process