Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan
From MaRDI portal
Publication:2256367
DOI10.1016/j.mcm.2011.05.029zbMath1305.90178OpenAlexW2130874842MaRDI QIDQ2256367
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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Total completion time with makespan constraint in no-wait flowshops with setup times ⋮ Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem ⋮ Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study ⋮ 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
