Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan
DOI10.1016/J.MCM.2011.05.029zbMATH Open1305.90178OpenAlexW2130874842MaRDI QIDQ2256367FDOQ2256367
Ivan Zelinka, Magdalena Bialic-Davendra, Donald Davendra, Roman Senkerik, Roman Jasek
Publication date: 19 February 2015
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2011.05.029
Recommendations
- Study on MDIS algorithm for the no-wait flow-shop scheduling
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cited In (5)
- Total completion time with makespan constraint in no-wait flowshops with setup times
- Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study
- An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem
- Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem
- A survey of scheduling problems with no-wait in process
Uses Software
This page was built for publication: Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256367)
