Two machines flow shop with reentrance and exact time lag
From MaRDI portal
Publication:2805477
DOI10.1051/ro/2015015zbMath1338.90157OpenAlexW2306235022MaRDI QIDQ2805477
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
Related Items (1)
Cites Work
- Unnamed Item
- Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
- Scheduling of coupled tasks with unit processing times
- V-shop scheduling
- 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
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- On-line two-machine open shop scheduling with time lags
- Sequencing n Jobs on Two Machines with Arbitrary Time Lags
- Optimal two- and three-stage production schedules with setup times included
- Two-stage hybrid flow shop with recirculation
- Scheduling coupled tasks
- Shop Problems With Two Machines and Time Lags
- Minimizing Makespan in a Class of Reentrant Shops
- Approximation Algorithms for Scheduling Problems with Exact Delays
- On the complexity of coupled-task scheduling
This page was built for publication: Two machines flow shop with reentrance and exact time lag
