A flexible flowshop problem with total flow time minimization

DOI10.1016/S0377-2217(00)00142-9zbMath1024.90037OpenAlexW2068727565WikidataQ127289145 ScholiaQ127289145MaRDI QIDQ5939584

Ergin Çakmak, Azizoglu, Meral, Suna Kondakci

Publication date: 30 November 2003

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

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

zbMATH Keywords

efficiencyparallel machinesbranch and bound algorithmdominance criterionflexible flowshop environmentoptimal scheduletotal flow time

Mathematics Subject Classification ID

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

Related Items (12)

Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ A taxonomy of flexible flow line scheduling procedures ⋮ Hybrid flowshop scheduling with machine and resource-dependent processing times ⋮ A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness ⋮ A review of exact solution methods for the non-preemptive multiprocessor flowshop problem ⋮ The hybrid flow shop scheduling problem ⋮ Scheduling jobs on a \(k\)-stage flexible flow-shop ⋮ Metaheuristic algorithms for the hybrid flowshop scheduling problem ⋮ Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines ⋮ Conceptual framework for lot-sizing and scheduling of flexible flow lines ⋮ Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds ⋮ Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Branch and bound algorithm for the flow shop with multiple processors
• An efficient heuristic approach to the scheduling of jobs in a flowshop
• A multi-stage parallel-processor flowshop problem with minimum flowtime
• Scheduling a two-stage hybrid flowshop with separable setup and removal times
• A new heuristic for the n-job, M-machine flow-shop problem
• Optimal two- and three-stage production schedules with setup times included
• Textile Production Systems: a Succession of Non-identical Parallel Processor Shops
• Two-Stage, Hybrid Flowshop Scheduling Problem
• AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
• The Complexity of Flowshop and Jobshop Scheduling
• Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline

This page was built for publication: A flexible flowshop problem with total flow time minimization