On the connection between a cyclic job shop and a reentrant flow shop scheduling problem

DOI10.1007/S10951-006-7041-ZzbMath1154.90492OpenAlexW2126394800MaRDI QIDQ880555

Zhihui Xue, George Steiner

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-006-7041-z

zbMATH Keywords

MakespanJob shopAlgorithms and complexityCycle timeReentrant flow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

New multi-objective method to solve reentrant hybrid flow shop scheduling problem

Cites Work

• V-shop scheduling
• A heuristic algorithm for two-machine re-entrant shop scheduling
• The complexity of cyclic shop scheduling problems
• Performance Measures and Schedules in Periodic Job Shops
• Minimizing Makespan in a Class of Reentrant Shops

This page was built for publication: On the connection between a cyclic job shop and a reentrant flow shop scheduling problem