Open shop cyclic scheduling
From MaRDI portal
Recommendations
Cites work
- A branch \(\&\) bound algorithm for the open-shop problem
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A general model for cyclic machine scheduling problems
- A hybrid genetic algorithm for the open shop scheduling problem
- A new particle swarm optimization for the open shop scheduling problem
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Benchmarks for basic scheduling problems
- Chromatic scheduling in a cyclic open shop
- Cyclic job shop scheduling problems with blocking
- Cyclic scheduling problems.
- Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
- Introduction to algorithms
- New block properties for the permutation flow shop problem with application in tabu search
- Open Shop Scheduling to Minimize Finish Time
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- The complexity of cyclic shop scheduling problems
- The job shop scheduling problem: Conventional and new solution techniques
Cited in
(5)- Cyclic flow-shop scheduling with no-wait constraints and missing operations
- Grouping tasks to save energy in a cyclic scheduling problem: a complexity study
- The cycle shop scheduling: mathematical model, properties and solution algorithms
- Mathematical model for cyclic scheduling with work-in-process minimization
- The cyclic compact open-shop scheduling problem
This page was built for publication: Open shop cyclic scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1750495)