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

DOI10.1007/3-540-61310-2_28MaRDI QIDQ4645936zbMATH OpenOpenAlexFDO

Authors Han Hoogeveen, T. 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

heuristicsworst-case analysispolynomial algorithmsflowshoptotal completion time\(\mathcal{NP}\)-hardnessspecial cases

Mathematics Subject Classification ID

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

Recommendations

• Minimizing total completion time in a two-machine flowshop: Analysis of special cases
• Two-machine flow-shop scheduling problems with minimizing the total completion times
• Minimizing total completion time in two-machine flow shops with exact delays
• Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
• Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
• Lower bounds for minimizing total completion time in a two-machine flow shop
• A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP
• Minimizing the total flow time and the tardiness in a two-machine flow shop
• Minimizing total completion time in two-stage hybrid flow shop with dedicated machines
• Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems

Cited in

(9)

• Minimizing total completion time in a two-machine flowshop: Analysis of special cases
• Minimizing Mean Completion Time for Special Flowshop Problems
• Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
• Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
• Minimizing total completion time in two-machine flow shops with exact delays
• scientific article; zbMATH DE number 4074798 (Why is no real title available?)
• Formulating a scheduling problem with almost identical jobs by using positional completion times
• Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time
• An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop

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

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