Two-Machine No-Wait Flow Shop Scheduling with Missing Operations

DOI10.1287/moor.24.4.911zbMath0977.90014OpenAlexW2095596350MaRDI QIDQ2757617

Chris N. Potts, Jatinder N. D. Gupta, Celia A. Dr. Glass

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.24.4.911

zbMATH Keywords

list schedulingapproximationmakespanflow shop

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (11)

Cyclic flow-shop scheduling with no-wait constraints and missing operations ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Some local search algorithms for no-wait flow-shop problem with makespan criterion ⋮ Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing ⋮ Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility ⋮ A survey of scheduling problems with no-wait in process ⋮ A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. ⋮ No-wait two-stage flowshop problem with multi-task flexibility of the first machine ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics ⋮ The flow shop problem with no-idle constraints: a review and approximation ⋮ SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS

This page was built for publication: Two-Machine No-Wait Flow Shop Scheduling with Missing Operations