A survey and evaluation of static flowshop scheduling heuristics

DOI10.1080/00207548408942436zbMath0541.90055OpenAlexW2163465352MaRDI QIDQ3329204

E. Emory Enscore, Yang Byung Park, Claude Dennis Pegden

Publication date: 1984

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207548408942436

zbMATH Keywords

surveysimulation modelcomparison of heuristicsevaluation of static flowshop scheduling rules

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (22)

An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal ⋮ On the combinatorial structure of the permutation flow shop problem ⋮ Job-shop production scheduling with reverse flows ⋮ Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem ⋮ Flowshop sequencing problems with limited buffer storage ⋮ Heuristic procedures for minimizing makespan and the number of required pallets ⋮ An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ On the heuristic solution of the permutation flow shop problem by path algorithms ⋮ A simulation analysis of robot service movements in FMC ⋮ Design and scheduling of flexible assembly lines for printed circuit boards ⋮ A comprehensive review and evaluation of permutation flowshop heuristics ⋮ Scheduling algorithms for flexible flowshops: Worst and average case performance ⋮ A heuristic algorithm to schedule work in the repair industry ⋮ Heuristics for scheduling in a flow shop with multiple processors ⋮ An improved branch and bound procedure for scheduling a flow line manufacturing cell ⋮ A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines ⋮ Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process ⋮ Heuristic methods and applications: A categorized survey ⋮ A new constructive heuristic for the flowshop scheduling problem ⋮ Scheduling a flowline manufacturing cell with sequence dependent family setup times ⋮ Reduction of job-shop problems to flow-shop problems with precedence constraints ⋮ Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time

Cites Work

• Unnamed Item
• Solutions to the Constrained Flowshop Sequencing Problem
• Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

This page was built for publication: A survey and evaluation of static flowshop scheduling heuristics