Open shop cyclic scheduling
From MaRDI portal
Publication:1750495
DOI10.1016/j.ejor.2018.02.021zbMath1388.90054OpenAlexW2793920897MaRDI QIDQ1750495
Jaroslaw Pempera, Czesław Smutnicki
Publication date: 22 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.02.021
Related Items (2)
Cyclic flow-shop scheduling with no-wait constraints and missing operations ⋮ Grouping tasks to save energy in a cyclic scheduling problem: a complexity study
Cites Work
- Cyclic job shop scheduling problems with blocking
- A general model for cyclic machine scheduling problems
- The job shop scheduling problem: Conventional and new solution techniques
- A branch \(\&\) bound algorithm for the open-shop problem
- A hybrid genetic algorithm for the open shop scheduling problem
- The complexity of cyclic shop scheduling problems
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Chromatic scheduling in a cyclic open shop
- Benchmarks for basic scheduling problems
- A new particle swarm optimization for the open shop scheduling problem
- Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- Open Shop Scheduling to Minimize Finish Time
- A Fast Taboo Search Algorithm for the Job Shop Problem
- New block properties for the permutation flow shop problem with application in tabu search
- Unnamed Item
- Unnamed Item
This page was built for publication: Open shop cyclic scheduling
