Concurrent flowshop scheduling to minimize makespan.

DOI10.1016/S0377-2217(03)00142-5MaRDI QIDQ1429959zbMATH OpenOpenAlexFDO

Authors C. Koulamas, George J. Kyparisis

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

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

Recommendations

• Minimizing makespan in parallel flowshops
• Minimizing the makespan for the flow shop scheduling problem with availability constraints.
• A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
• scientific article; zbMATH DE number 1054688
• Flowshop-scheduling problems with makespan criterion: a review
• Flow shop-sequencing problem with synchronous transfers and makespan minimization
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
• Scheduling in flowshops to minimize total tardiness of jobs
• Minimizing makespan in hybrid flowshops

Cites work

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

Cited in

(5)

• Minimizing makespan in parallel flowshops
• Minimizing makespan and throughput times at Aalsmeer flower auction
• Flowshop-scheduling problems with makespan criterion: a review
• Assembly-line scheduling with concurrent operations and parallel machines
• Flow shop-sequencing problem with synchronous transfers and makespan minimization

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

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