Scheduling algorithms for flexible flowshops: Worst and average case performance

DOI10.1016/0377-2217(89)90208-7zbMath0691.90038MaRDI QIDQ583096

Suresh P. Sethi, Chelliah Skriskandarajah

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90208-7

zbMATH Keywords

heuristic; task scheduling; worst case; flexible flowshop; mean behaviors; minimum length schedule; parallel machines at each stage

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

65K05: Numerical mathematical programming methods

90B35: Deterministic scheduling theory in operations research

Related Items

Scheduling flexible flow lines with no in-process buffers, Comparison of Scheduling Rules in a Flow Shop with Multiple Processors: A Simulation, Scheduling in dial-indexed production lines, Scheduling manufacturing systems for delayed product differentiation in agile manufacturing, A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately, A flexible flowshop problem with total flow time minimization, Fuzzy flexible flow shops at two machine centers for continuous fuzzy domains, Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints, An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, Optimal scheduling of a two-stage hybrid flow shop, A taxonomy of flexible flow line scheduling procedures, Scheduling problems in master-slave model, A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria, Minimizing makespan in two-stage hybrid cross docking scheduling problem, Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint, A genetic algorithm for the proportionate multiprocessor open shop, Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard, A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem, Sequencing jobs for an automated manufacturing module with buffer, Combinatorial optimization models for production scheduling in automated manufacturing systems, Performance of scheduling algorithms for no-wait flowshops with parallel machines, Worst-case analysis of heuristics for open shops with parallel machines, Minimizing makespan in hybrid flowshops, A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem, The flow shop with parallel machines: A tabu search approach, A review of exact solution methods for the non-preemptive multiprocessor flowshop problem, Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines, Heuristics for scheduling in a flow shop with multiple processors, Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling, Scheduling flexible flow lines with sequence-dependent setup times, A note on makespan minimization in two-stage flexible flow shops with uniform machines, A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines, Scheduling two-stage hybrid flow shop with availability constraints, Scheduling in network flow shops, Three stage generalized flowshop: Scheduling civil engineering projects, A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility, A review of TSP based approaches for flowshop scheduling, An introduction of dominant genes in genetic algorithm for FMS, A computational study of heuristics for two-stage flexible flowshops, Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time

Cites Work