Global lower bounds for flow shops with multiple processors

DOI10.1016/0377-2217(93)E0326-SzbMATH Open0927.90052MaRDI QIDQ1129960FDOQ1129960

Authors: D. E. Deal, Daryl L. Santos, John L. Hunsucker 

Publication date: 16 August 1998

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

Recommendations

• A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
• The hybrid flow shop scheduling problem
• Heuristics for scheduling in a flow shop with multiple processors
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.

zbMATH Keywords

NP-completeflow shopmultiple processorsoptimal makespansub-optimal heuristic methods

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• Branch and bound algorithm for the flow shop with multiple processors
• Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment
• The Two-Stage Flowshop Scheduling Problem with M Machines at each Stage

Cited In (19)

• Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines
• Machine scheduling in underground mining: an application in the potash industry
• Bounding strategies for the hybrid flow shop scheduling problem
• Bottleneck-focused scheduling for a hybrid flowshop
• A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
• A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal
• Modeling realistic hybrid flexible flowshop scheduling problems
• Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
• The hybrid flow shop scheduling problem
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
• Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
• An integrated approach for modeling and solving the scheduling problem of container handling systems
• A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
• New heuristics for total tardiness minimization in a flexible flowshop
• Scheduling jobs on a \(k\)-stage flexible flow-shop
• Heuristics for scheduling in a flow shop with multiple processors
• Preemptive hybrid flowshop scheduling problem of interval orders
• A new three-machine shop scheduling: complexity and approximation algorithm

This page was built for publication: Global lower bounds for flow shops with multiple processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129960)