Makespan minimization in reentrant flow shop problem with identical jobs

DOI10.17223/20710410/64/8zbMATH Open1543.90105MaRDI QIDQ6573405FDOQ6573405

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)

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

zbMATH Keywords

NP-hardnessscheduleidentical jobspseudopolynomial algorithmtheory of NP-completeness

Mathematics Subject Classification ID

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

Cites Work

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

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)