Two machines flow shop with reentrance and exact time lag

DOI10.1051/RO/2015015MaRDI QIDQ2805477zbMATH OpenOpenAlexFDO

Authors Karim Amrouche, Mourad Boudhar

Publication date 11 May 2016

Published in RAIRO. Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2015015

zbMATH Keywords

complexitymakespanflow shoptime lagreentrance

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Shop Problems With Two Machines and Time Lags
• Minimizing makespan on a two-machine re-entrant flowshop
• Minimizing total tardiness on a two-machine re-entrant flowshop
• Algorithms and Computation
• Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times

Cites work

• scientific article; zbMATH DE number 900396 (Why is no real title available?)
• An exact algorithm for scheduling identical coupled tasks
• Approximation Algorithms for Scheduling Problems with Exact Delays
• Approximation algorithms for UET scheduling problems with exact delays
• Minimizing Makespan in a Class of Reentrant Shops
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
• On the complexity of coupled-task scheduling
• On-line two-machine open shop scheduling with time lags
• Optimal two- and three-stage production schedules with set-up time included
• Scheduling coupled tasks
• Scheduling of coupled tasks and one-machine no-wait robotic cells
• Scheduling of coupled tasks with unit processing times
• Sequencing \(n\) jobs on two machines with arbitrary time lags
• Shop Problems With Two Machines and Time Lags
• Two-stage hybrid flow shop with recirculation
• V-shop scheduling

Cited in

(3)

• Reentrant open shop scheduling problem with time lags and no-wait constraints
• Coupled task scheduling with exact delays: literature review and models
• New efficient algorithms for the two-machine no-wait chain-reentrant shop problem

This page was built for publication: Two machines flow shop with reentrance and exact time lag

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