Two machines flow shop with reentrance and exact time lag

DOI10.1051/RO/2015015zbMATH Open1338.90157OpenAlexW2306235022MaRDI QIDQ2805477FDOQ2805477

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)

Cites Work

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