Properties of two-machine no-wait flowshop scheduling problems

MaRDI QIDQ4980617zbMATH OpenFDO

Authors Kejia Chen, Xiao Wang

Publication date 30 June 2014

zbMATH Keywords

complexityno-waitobjective functionpermutation scheduletwo-machine flowshop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36)

Recommendations

• Two-machine flow shop scheduling problems with no-wait jobs
• Two-machine no-wait flow shop scheduling problem with precedence constraints
• Two-machine no-wait flow shop scheduling with missing operations
• No-wait flexible flowshop scheduling with no-idle machines
• The proportionate two-machine no-wait job shop scheduling problem

Cited in

(8)

• A survey of scheduling problems with no-wait in process
• Two-machine flow shop scheduling problems with no-wait jobs
• A combinatorial property of Pallet-constrained two machine flow shop problem in minimizing makespan
• Two-machine no-wait flow shop scheduling with missing operations
• Two-machine flow shop no-wait scheduling with a nonavailability interval
• The proportionate two-machine no-wait job shop scheduling problem
• Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
• Two-machine no-wait flow shop scheduling problem with precedence constraints

This page was built for publication: Properties of two-machine no-wait flowshop scheduling problems

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