Heuristics for scheduling in a flow shop with multiple processors

From MaRDI portal
Publication:1806647

DOI10.1016/S0377-2217(97)00423-2zbMath0933.90026MaRDI QIDQ1806647

Luan Luan Loo, Shaukat A. Brah

Publication date: 8 November 1999

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




Related Items

Scheduling flexible flow lines with sequence-dependent setup times, Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis, Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines, NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness, A taxonomy of flexible flow line scheduling procedures, Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case, A new three-machine shop scheduling: complexity and approximation algorithm, Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems, A heuristic algorithm for the hospital health examination scheduling problem, A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage., Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems, Using simulation and multi-criteria methods to provide robust solutions to dispatching problems in a flow shop with multiple processors, On the optimality conditions of the two-machine flow shop problem, Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective, A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains, The hybrid flow shop scheduling problem, Metaheuristic algorithms for the hybrid flowshop scheduling problem, Capacity-filtering algorithms for finite-capacity planning of a flexible flow line, Heuristic factory planning algorithm for advanced planning and scheduling, Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop, Conceptual framework for lot-sizing and scheduling of flexible flow lines, A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines, Modified drum–buffer–rope scheduling mechanism for a non-identical parallel machine flow shop with processing-time variation, Bottleneck-focused scheduling for a hybrid flowshop



Cites Work