An algorithm with bounds for the proportional case of a two-machine problem in flow-shop scheduling theory with minimum delays

zbMATH Open1249.90065MaRDI QIDQ3115649FDOQ3115649

Authors: Alexander Ageev 

Publication date: 10 February 2012

Recommendations

• A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays
• Two-machine flow shop scheduling problems with minimal and maximal delays
• A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
• SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
• scientific article; zbMATH DE number 900396

zbMATH Keywords

completion timerelative error

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (6)

• The proportionate two-machine no-wait job shop scheduling problem
• Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
• A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
• A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays
• Two-machine flow shop scheduling problems with minimal and maximal delays
• Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines

This page was built for publication: An algorithm with bounds for the proportional case of a two-machine problem in flow-shop scheduling theory with minimum delays

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