Algorithms for scheduling on parallel batch machines with non-identical capacities and non-identical job sizes

DOI10.13195/J.KZYJC.2014.1704MaRDI QIDQ2992407zbMATH OpenFDO

Authors Zhao-hong Jia, Xiaohao Li, Tingting Wen, Longshu Li

Publication date 10 August 2016

zbMATH Keywords

ant colony optimization algorithmnon-identical job sizesparallel batch processing machinesnon-identical machine capacities

Mathematics Subject Classification ID

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

Recommendations

• Weak-restriction based algorithm for scheduling on parallel batch machines with arbitrary capacities
• Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
• Integrated scheduling on parallel batch processing machines with non-identical capacities
• Scheduling unrelated parallel batch processing machines with non-identical job sizes

Cited in

(4)

• Weak-restriction based algorithm for scheduling on parallel batch machines with arbitrary capacities
• A bi-objective synergy optimization algorithm of ant colony for scheduling on non-identical parallel batch machines
• Integrated scheduling on parallel batch processing machines with non-identical capacities
• Scheduling jobs with sizes and delivery times on identical parallel batch machines

This page was built for publication: Algorithms for scheduling on parallel batch machines with non-identical capacities and non-identical job sizes

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