Research on batch scheduling problems with job release time based on a max-min ant system

MaRDI QIDQ2916019zbMATH OpenFDO

Authors Rui Xu, Huaping Chen, Junhong Zhu

Publication date 5 October 2012

Published in Journal of Systems Engineering (Search for Journal in Brave)

zbMATH Keywords

makespanrelease timebatch schedulingant algorithm

Mathematics Subject Classification ID

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

Recommendations

• Scheduling batch processing machine using max-min ant system algorithm improved by a local search method
• An improved ant colony algorithm for solving batch scheduling problems with non-identical job sizes
• Makespan minimization on single batch-processing machine via ant colony optimization
• Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
• Minimizing makespan in batch machine scheduling

Cited in

(3)

• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
• An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
• Scheduling batch processing machine using max-min ant system algorithm improved by a local search method

This page was built for publication: Research on batch scheduling problems with job release time based on a max-min ant system

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