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

DOI10.1002/(SICI)1520-6750(200006)47:4%3C353::AID-NAV5%3E3.0.CO;2-UMaRDI QIDQ4488784zbMATH OpenOpenAlexFDO

Authors Ondřej Čepek, Masanori Okada, Milan Vlach

Publication date 24 June 2001

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(200006)47:4%3C353::aid-nav5%3E3.0.co;2-u

zbMATH Keywords

no-idle feasibility constrainttwo-machine flowshop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
• Flowshop/no-idle scheduling to minimise the mean flowtime
• No-wait flexible flowshop scheduling with no-idle machines
• A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
• The flow shop problem with no-idle constraints: a review and approximation

Cited in

(7)

• A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
• Comments on Flow shop and open shop scheduling with a critical machine and two operations per job
• A note on the flow-shop problem without interruptions in job processing
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
• Flowshop/no-idle scheduling to minimise the mean flowtime
• scientific article; zbMATH DE number 3982900 (Why is no real title available?)
• An exact block algorithm for no-idle RPQ problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4488784)