Scheduling algorithms for flexible flowshops: Worst and average case performance

DOI10.1016/0377-2217(89)90208-7zbMath0691.90038OpenAlexW2050193551MaRDI 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

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling flexible flow lines with sequence-dependent setup times, Minimizing makespan in hybrid flowshops, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, Scheduling manufacturing systems for delayed product differentiation in agile manufacturing, An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, Two-stage, single-lot, lot streaming problem for a \(1+2\) hybrid flow shop, Optimal scheduling of a two-stage hybrid flow shop, A taxonomy of flexible flow line scheduling procedures, Flowshop scheduling with interstage job transportation, Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility, A note on makespan minimization in two-stage flexible flow shops with uniform machines, An introduction of dominant genes in genetic algorithm for FMS, A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines, Hybrid flowshop scheduling with interstage job transportation, 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, Scheduling flexible flow lines with no in-process buffers, 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, A flexible flowshop problem with total flow time minimization, The hybrid flow shop scheduling problem, Scheduling two-stage hybrid flow shop with availability constraints, Fuzzy flexible flow shops at two machine centers for continuous fuzzy domains, A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately, Comparison of Scheduling Rules in a Flow Shop with Multiple Processors: A Simulation, Survey on fuzzy shop scheduling, 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, Heuristics for scheduling in a flow shop with multiple processors, 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, A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem, Scheduling in dial-indexed production lines, 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, A computational study of heuristics for two-stage flexible flowshops, Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time, Performance of scheduling algorithms for no-wait flowshops with parallel machines, Worst-case analysis of heuristics for open shops with parallel machines, Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints, The flow shop with parallel machines: A tabu search approach, Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling

Cites Work