Maximizing total early work in a distributed two‐machine flow‐shop

DOI10.1002/NAV.22076zbMath1525.90196OpenAlexW4292731281MaRDI QIDQ6078603

Mikhail Y. Kovalyov, Bertrand M. T. Lin, Alexandre Dolgui

Publication date: 24 October 2023

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.22076

zbMATH Keywords

schedulingdynamic programminginteger linear programmingFPTAStwo-machine flow-shopearly workdistributed flow-shop

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (1)

Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system

Cites Work

• Unnamed Item
• Unnamed Item
• A scatter search algorithm for the distributed permutation flowshop scheduling problem
• An FPTAS for the parallel two-stage flowshop problem
• The distributed permutation flowshop scheduling problem
• Single machine scheduling with assignable due dates
• Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
• The two-machine flow-shop problem with weighted late work criterion and common due date
• Parameterized complexity of machine scheduling: 15 open problems
• Mirror scheduling problems with early work and late work criteria
• Two-machine flow shop scheduling with a common due date to maximize total early work
• A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
• A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements
• On the parameterized tractability of the just-in-time flow-shop scheduling problem
• Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem
• Exact solutions for the two-machine robust flow shop with budgeted uncertainty
• Optimal two- and three-stage production schedules with setup times included
• Critical-Path Planning and Scheduling: Mathematical Basis
• Single Machine Scheduling to Minimize Total Late Work
• Single machine scheduling with assignable due dates to minimize maximum and total late work

This page was built for publication: Maximizing total early work in a distributed two‐machine flow‐shop