Minimizing total completion time in a two-machine flowshop: Analysis of special cases
DOI10.1007/3-540-61310-2_28zbMATH Open1414.90151OpenAlexW1589038791MaRDI QIDQ4645936FDOQ4645936
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
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
heuristicsworst-case analysispolynomial algorithmsflowshoptotal completion time\(\mathcal{NP}\)-hardnessspecial cases
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- Flowshop and Jobshop Schedules: Complexity and Approximation
Cited In (8)
- 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
- Title not available (Why is that?)
- Formulating a scheduling problem with almost identical jobs by using positional completion times
- 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)
