Survey on optimization algorithms for distributed shop scheduling
From MaRDI portal
Publication:2994077
DOI10.13195/J.KZYJC.2014.1949zbMATH Open1349.90412MaRDI QIDQ2994077FDOQ2994077
Authors: Ling Wang, Jin Deng, Shengyao Wang
Publication date: 10 August 2016
Recommendations
- Distributed scheduling: a review of concepts and applications
- An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
- The distributed permutation flowshop scheduling problem
- Model and algorithms of the distributed permutation flow shop scheduling problem with machine eligibility constraints
- Exact, Heuristic and Meta-heuristic Algorithms for Solving Shop Scheduling Problems
Cited In (4)
- A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time
- Advances in green shop scheduling and optimization
- Distributed assembly permutation flow-shop scheduling problem with sequence-dependent set-up times using a novel biogeography-based optimization algorithm
- Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups
This page was built for publication: Survey on optimization algorithms for distributed shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2994077)