The Lessons of Flowshop Scheduling Research

DOI10.1287/opre.40.1.7zbMath0825.90554OpenAlexW2119225931MaRDI QIDQ3991317

R. Dudek, Milton L. Smith, Shrikant S. Panwalkar

Publication date: 28 June 1992

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.40.1.7

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

New hard benchmark for flowshop scheduling problems minimising makespan, A worst-case analysis of the three-machine flow shop scheduling, Experimental comparison of heuristics for flow shop scheduling, An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion, Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines, Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint, On optimizing a bi-objective flowshop scheduling problem in an uncertain environment, Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times, Minimizing total tardiness in permutation flowshops, Modified simulated annealing algorithms for the flow shop sequencing problem, Multiple and bicriteria scheduling: A literature survey, A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows, Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness, Solving the continuous flow-shop scheduling problem by metaheuristics., Frameworks for adaptable scheduling algorithms, Modeling realistic hybrid flexible flowshop scheduling problems, A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP, Some effective heuristics for no-wait flowshops with setup times to minimize total completion time, A new lower bounding rule for permutation flow shop scheduling, A modification to the CGPS algorithm for three-machine flow shop scheduling, Continuous flow models for batch manufacturing: a basis for a hierarchical approach, Real-time routing in flexible flow shops: a self-adaptive swarm-based control model, Architecture of manufacturing scheduling systems: literature review and an integrated proposal, A comprehensive review and evaluation of permutation flowshop heuristics, Flow shop-sequencing problem with synchronous transfers and makespan minimization, Algorithms for a realistic variant of flowshop scheduling, The evolution of schematic representations of flow shop scheduling problems, The job shop scheduling problem: Conventional and new solution techniques, Heuristics for permutation flow shop scheduling with batch setup times, Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times, Variants of the two machine flow shop problem connected with factorization of matrix functions, Sevast'yanov's algorithm for the flow-shop scheduling problem, Comparison of iterative improvement techniques for schedule optimization, A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem, Two-machine flowshop scheduling with availability constraints, Flowshop scheduling research after five decades, A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility, A review of TSP based approaches for flowshop scheduling, Machine scheduling models in environmentally focused chemical manufacturing, A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size, Constructing a fuzzy flow-shop sequencing model based on statistical data, Looking ahead with the pilot method