Minimizing total completion time in a two-machine flowshop: Analysis of special cases

DOI10.1007/3-540-61310-2_28zbMath1414.90151OpenAlexW1589038791MaRDI QIDQ4645936

Hoogeveen, J. A., Tsuyoshi Kawaguchi

Publication date: 11 January 2019

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61310-2_28

zbMATH Keywords

heuristicsflowshoppolynomial algorithmsworst-case analysistotal completion time\(\mathcal{NP}\)-hardnessspecial cases

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Formulating a scheduling problem with almost identical jobs by using positional completion times

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Minimizing total completion time in a two-machine flowshop: Analysis of special cases