Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
From MaRDI portal
Publication:2757616
DOI10.1287/moor.24.4.887zbMath0977.90015OpenAlexW2160424269MaRDI QIDQ2757616
Tsuyoshi Kawaguchi, Hoogeveen, J. A.
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.24.4.887
Analysis of algorithms and problem complexity (68Q25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items
Trade-off balancing in scheduling for flow shop production and perioperative processes ⋮ Minimizing total completion time in a two-machine flow shop with deteriorating jobs ⋮ The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation ⋮ Several flow shop scheduling problems with truncated position-based learning effect ⋮ Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage ⋮ Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines ⋮ Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration ⋮ Minimizing total completion time in two-stage hybrid flow shop with dedicated machines ⋮ Minimizing makespan in an ordered flow shop with machine-dependent processing times ⋮ A note on makespan minimization in proportionate flow shops ⋮ Some results of the worst-case analysis for flow shop scheduling with a learning effect ⋮ A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP ⋮ Two machine flow shop scheduling problem with weighted WIP costs ⋮ Flow shops with WIP and value added costs ⋮ Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects ⋮ A two-machine flowshop problem with two agents ⋮ Flow shops with machine maintenance: ordered and proportionate cases ⋮ TWO-STAGE FLOWSHOP SCHEDULING PROBLEMS WITH IDENTICAL AND BATCH PROCESSORS ⋮ Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time ⋮ Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds ⋮ Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects ⋮ Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine ⋮ A robust two-machine flow-shop scheduling model with scenario-dependent processing times ⋮ A bicriteria two-machine permutation flowshop problem ⋮ Some results of the worst-case analysis for flow shop scheduling ⋮ An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
