Batch scheduling in a two-stage flexible flow shop problem
From MaRDI portal
Publication:902743
DOI10.2478/FCDS-2014-0001zbMath1328.90048OpenAlexW2033242545MaRDI QIDQ902743
Enrique Gerstl, Assaf Sarig, Gur Mosheiov
Publication date: 4 January 2016
Published in: Foundations of Computing and Decision Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/fcds-2014-0001
Cites Work
- Unnamed Item
- The optimal number of used machines in a two-stage flexible flowshop scheduling problem
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- Minimizing the number of machines for scheduling jobs with equal processing times
- Minimizing the number of machines for minimum length schedules
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
- Two-stage flowshop scheduling with a common second-stage machine
- Flow shop and open shop scheduling with a critical machine and two operations per job
- Scheduling unrelated parallel machines with optional machines and jobs selection
- Comments on Flow shop and open shop scheduling with a critical machine and two operations per job
- A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
- The hybrid flow shop scheduling problem
- Parallel machine selection and job scheduling to minimize machine cost and job tardiness
- Parallel machine problems with equal processing times: a survey
- A survey of scheduling problems with setup times or costs
- Minimizing flow-time on a single machine with integer batch sizes
- A two-stage flow shop scheduling with a critical machine and batch availability
- On the Complexity of Scheduling with Batch Setup Times
This page was built for publication: Batch scheduling in a two-stage flexible flow shop problem
