Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment

DOI10.1016/0377-2217(94)90333-6zbMath0800.90570OpenAlexW1968714144MaRDI QIDQ1319566

J. R. Shah, John L. Hunsucker

Publication date: 12 April 1994

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90333-6

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis, A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation, Scheduling manufacturing systems for delayed product differentiation in agile manufacturing, Global lower bounds for flow shops with multiple processors, Optimal Parallel Machine Allocation Problem in IC Packaging Using IC-PSO: An Empirical Study, A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop, The hybrid flow shop scheduling problem, Simultaneous job input sequencing and vehicle dispatching in a single-vehicle automated guided vehicle system: a heuristic branch-and-bound approach coupled with a discrete events simulation model, Heuristics for scheduling in a flow shop with multiple processors, A study on the performance of scheduling rules in buffer-constrained dynamic flowshops, FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors, A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines, A hybrid two-stage flowshop with part family, batch production, major and minor set-ups, Scheduling two machines that require multiple types of maintenance, for a single operation, Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time, The flow shop with parallel machines: A tabu search approach, A comparative study of dispatching rules in dynamic flowshops and jobshops

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Branch and bound algorithm for the flow shop with multiple processors
• Survey of scheduling research involving due date determination decisions
• Feature Article—Statistical Analysis of Simulation Output Data
• Two-Stage, Hybrid Flowshop Scheduling Problem
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• Statistical analysis of the output data from terminating simulations
• Priority Update Intervals and Anomalies in Dynamic Ratio Type Job Shop Scheduling Rules
• A Review of Production Scheduling
• A Survey of Scheduling Rules
• An Evaluation of Flow Shop Sequencing Heuristics
• The Complexity of Flowshop and Jobshop Scheduling