Makespan minimization in reentrant flow shop problem with identical jobs

DOI10.17223/20710410/64/8MaRDI QIDQ6573405zbMATH OpenFDO

Authors Anna A. Romanova, V. V. Servakh, V. Yu. Tavchenko

Publication date 16 July 2024

Published in Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

zbMATH Keywords

NP-hardnessscheduleidentical jobspseudopolynomial algorithmtheory of NP-completeness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Recommendations

• Minimizing makespan on an \(m\)-machine re-entrant flowshop
• Minimizing total completion time for re-entrant flow shop scheduling problems
• Minimizing makespan on a two-machine re-entrant flowshop
• Minimizing makespan in re-entrant permutation flow-shops
• Minimizing Makespan in a Class of Reentrant Shops

Cites work

• scientific article; zbMATH DE number 1534501 (Why is no real title available?)
• Cyclic scheduling in a robotic production line
• Flow shops with reentry: reversibility properties and makespan optimal schedules
• Mean Flow Time Minimization in Reentrant Job Shops with a Hub
• Minimizing Makespan in a Class of Reentrant Shops
• Minimizing makespan in re-entrant permutation flow-shops
• Minimizing the number of robots to meet a given cyclic schedule
• NP-hardness of shop-scheduling problems with three jobs
• On scheduling cycle shops: Classification, complexity and approximation
• Scheduling
• Scheduling jobshops with some identical or similar jobs
• The complexity of cyclic scheduling for identical jobs
• Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems
• V-shop scheduling

This page was built for publication: Makespan minimization in reentrant flow shop problem with identical jobs

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