V-shop scheduling

DOI10.1016/0377-2217(84)90260-1zbMath0542.90054OpenAlexW1981764433MaRDI QIDQ795725

V. Lev, Igal Adiri

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90260-1

zbMATH Keywords

binary NP-completeFlowshop schedulingV-shop scheduling

Mathematics Subject Classification ID

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

Related Items (11)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ On sum-free sets modulo \(p\) ⋮ Scheduling in reentrant robotic cells: algorithms and complexity ⋮ On the connection between a cyclic job shop and a reentrant flow shop scheduling problem ⋮ Multi-family scheduling in a two-machine reentrant flow shop with setups ⋮ Scheduling batches with simultaneous job processing for two-machine shop problems ⋮ Flow shops with reentry: reversibility properties and makespan optimal schedules ⋮ Two machines flow shop with reentrance and exact time lag ⋮ Time lag size in multiple operations flow shop scheduling heuristics ⋮ On scheduling cycle shops: Classification, complexity and approximation ⋮ The complexity of cyclic shop scheduling problems

Cites Work

• Unnamed Item
• Optimal two- and three-stage production schedules with setup times included
• On general routing problems
• The Complexity of Flowshop and Jobshop Scheduling

This page was built for publication: V-shop scheduling