Reversible-shop scheduling

DOI10.1016/0377-2217(87)90197-4zbMath0615.90060OpenAlexW2080906250MaRDI QIDQ1821023

V. Lev, N. Aizikowitz Hefetz, Igal Adiri

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0377-2217(87)90197-4

zbMATH Keywords

makespanbinary NP- hardreversible-shoproute-dependent reversible-shop

Mathematics Subject Classification ID

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

Cites Work

• Scheduling the Open Shop to Minimize Mean Flow Time
• Open Shop Scheduling to Minimize Finish Time
• A note on the influence of missing operations on scheduling problems

This page was built for publication: Reversible-shop scheduling