Solving a chemical batch scheduling problem by local search

DOI10.1023/A:1018959704264zbMath0997.90034OpenAlexW2133020361MaRDI QIDQ1593517

Peter Brucker, Johann L. Hurink

Publication date: 17 January 2001

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018959704264

zbMATH Keywords

tabu searchcase studytime-lagsbatch productiongeneral shop problemmixed graph scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Optimally competitive list batching, An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem, GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times, A cyclic approach to large-scale short-term planning in chemical batch production, Logic-based Benders decomposition for scheduling a batching machine