Global lower bounds for flow shops with multiple processors
From MaRDI portal
Publication:1129960
DOI10.1016/0377-2217(93)E0326-SzbMath0927.90052MaRDI QIDQ1129960
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)
Related Items
Machine scheduling in underground mining: an application in the potash industry, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines, A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal, A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks, A new three-machine shop scheduling: complexity and approximation algorithm, New heuristics for total tardiness minimization in a flexible flowshop, A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage., Modeling realistic hybrid flexible flowshop scheduling problems, Bounding strategies for the hybrid flow shop scheduling problem, A review of exact solution methods for the non-preemptive multiprocessor flowshop problem, The hybrid flow shop scheduling problem, Scheduling jobs on a \(k\)-stage flexible flow-shop, Preemptive hybrid flowshop scheduling problem of interval orders, Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines, An integrated approach for modeling and solving the scheduling problem of container handling systems, Heuristics for scheduling in a flow shop with multiple processors, Bottleneck-focused scheduling for a hybrid flowshop, Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
Cites Work
- 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
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- The Two-Stage Flowshop Scheduling Problem with M Machines at each Stage
- Unnamed Item
