Solving a chemical batch scheduling problem by local search

DOI10.1023/A:1018959704264MaRDI QIDQ1593517zbMATH OpenOpenAlexFDO

Authors 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 searchbatch productioncase studytime-lagsgeneral shop problemmixed graph scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A complex time based construction heuristic for batch scheduling problems in the chemical industry
• scientific article; zbMATH DE number 2154255
• LP-based heuristics for scheduling chemical batch processes
• A cyclic approach to large-scale short-term planning in chemical batch production
• A heuristic method for large-scale batch scheduling in the process industries

Cited in

(7)

• Sequence-dependent batch chemical scheduling with earliness and tardiness penalties
• A complex time based construction heuristic for batch scheduling problems in the chemical industry
• 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
• An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
• Logic-based Benders decomposition for scheduling a batching machine
• Optimally competitive list batching

This page was built for publication: Solving a chemical batch scheduling problem by local search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1593517)