Concurrent flowshop scheduling to minimize makespan.

DOI10.1016/S0377-2217(03)00142-5zbMath1056.90070OpenAlexW1996331245MaRDI QIDQ1429959

Kyparisis, George J., Christos P. Koulamas

Publication date: 27 May 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00142-5

zbMATH Keywords

Flowshop schedulingWorst case analysisApproximation/heuristicConcurrent operations

Mathematics Subject Classification ID

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

Related Items (1)

Flowshop-scheduling problems with makespan criterion: a review

Cites Work

• On some geometric methods in scheduling theory: A survey
• A heuristic algorithm for mean flowtime objective in flowshop scheduling
• The Tricriteria Two-Machine Flowshop Scheduling Problem
• Assembly-Line Scheduling with Concurrent Operations and Parallel Machines
• The Complexity of Flowshop and Jobshop Scheduling
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
• Minimizing Makespan in a Class of Reentrant Shops
• Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation

This page was built for publication: Concurrent flowshop scheduling to minimize makespan.