An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks

DOI10.1057/palgrave.jors.2602625zbMath1171.90412OpenAlexW2056772503MaRDI QIDQ3184454

Kuo-Ching Ying

Publication date: 15 October 2009

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

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602625

zbMATH Keywords

multiprocessor task schedulinghybrid flowshopiterated greedy heuristic

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (7)

Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times ⋮ Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates ⋮ Hybrid flowshop scheduling with machine and resource-dependent processing times ⋮ An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ The hybrid flow shop scheduling problem ⋮ Minimizing shifts for personnel task scheduling problems: a three-phase algorithm

This page was built for publication: An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks