Note: On the two-machine no-idle flowshop problem

DOI<353::AID-NAV5>3.0.CO;2-U 10.1002/(SICI)1520-6750(200006)47:4<353::AID-NAV5>3.0.CO;2-UzbMath0990.90037OpenAlexW2044471227MaRDI QIDQ4488784

Milan Vlach, Ondřej Čepek, Masanori Okada

Publication date: 24 June 2001

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(200006)47:4<353::aid-nav5>3.0.co;2-u

zbMATH Keywords

two-machine flowshop schedulingno-idle feasibility constraint

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem ⋮ A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion ⋮ An exact block algorithm for no-idle RPQ problem

This page was built for publication: Note: On the two-machine no-idle flowshop problem