Cyclic flow-shop scheduling with no-wait constraints and missing operations
From MaRDI portal
Publication:2140312
DOI10.1016/j.ejor.2021.12.049OpenAlexW4210377936MaRDI QIDQ2140312
Grzegorz Bocewicz, Czesław Smutnicki, Jaroslaw Pempera, Zbigniew Antoni Banaszak
Publication date: 20 May 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.12.049
Related Items
Cites Work
- Unnamed Item
- Cyclic job shop scheduling problems with blocking
- A general model for cyclic machine scheduling problems
- A fast tabu search algorithm for the permutation flow-shop problem
- A two-machine permutation flow shop scheduling problem with buffers
- Sequencing of jobs in some production system
- The permutation flow shop with buffers: A tabu search approach
- Open shop cyclic scheduling
- A comprehensive review and evaluation of permutation flowshop heuristics
- Benchmarks for basic scheduling problems
- Some local search algorithms for no-wait flow-shop problem with makespan criterion
- Two-Machine No-Wait Flow Shop Scheduling with Missing Operations
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- Tabu Search—Part I
- A note on scheduling jobs with missing operations in permutation flow shops
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- New block properties for the permutation flow shop problem with application in tabu search
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Flowshop-scheduling problems with makespan criterion: a review
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Scheduling
- A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs
