V-shop scheduling

DOI10.1016/0377-2217(84)90260-1MaRDI QIDQ795725zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Reversible-shop scheduling
• The complexity of cyclic shop scheduling problems
• On the complexity of non-preemptive shop scheduling with two jobs
• A note on scheduling alternative operations in two-machine flowshops
• The complexity of shop-scheduling problems with two or three jobs

Cites work

• scientific article; zbMATH DE number 3633982 (Why is no real title available?)
• On general routing problems
• Optimal two- and three-stage production schedules with set-up time included
• The Complexity of Flowshop and Jobshop Scheduling

Cited in

(14)

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

This page was built for publication: V-shop scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795725)