A computational study of heuristics for two-stage flexible flowshops
From MaRDI portal
Publication:4230155
DOI10.1080/00207549608904972zbMath0947.90540OpenAlexW2089773920WikidataQ126247383 ScholiaQ126247383MaRDI QIDQ4230155
P. K. Kedia, Marius M. Solomon, Alain Dussauchoy, A. G. P. Guinet
Publication date: 1 March 1999
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207549608904972
Related Items
Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis, 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, A discrete inter-species cuckoo search for flowshop scheduling problems, Hybrid variable neighborhood search for automated warehouse scheduling, New heuristics for total tardiness minimization in a flexible flowshop, Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach, A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks, A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines, Two-stage hybrid flow shop with recirculation, A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria, A review of exact solution methods for the non-preemptive multiprocessor flowshop problem, The hybrid flow shop scheduling problem, Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic, Preemptive hybrid flowshop scheduling problem of interval orders, Scheduling hybrid flowshop with parallel batching machines and compatibilities, A scheduling problem in the baking industry
Cites Work
