The distributed permutation flowshop scheduling problem
Bahman Naderi, Rubén Ruíz · Computers & Operations Research · 2009
Cited by 585 works. doi:10.1016/j.cor.2009.06.019
Authors
References
- Optimal two‐ and three‐stage production schedules with setup times included
- Introduction to Sequencing and Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Problems in the Analysis of Survey Data, and a Proposal
- The Complexity of Flowshop and Jobshop Scheduling
- Variable neighborhood search
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
- Benchmarks for basic scheduling problems
- Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum
- On the Job-Shop Scheduling Problem