Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families

DOI10.1504/IJMOR.2010.029691MaRDI QIDQ964482zbMATH OpenOpenAlexFDO

Authors M. Venkataramana, N. R. Srinivasa Raghavan

Publication date 15 April 2010

Published in International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijmor.2010.029691

zbMATH Keywords

ACOant colony optimisationbatch processingbatch processorsheuristicsschedulingtotal weighted tardinessTWT

Mathematics Subject Classification ID

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

Review text

Summary: In current dynamic business environments, meeting the customer due dates and avoiding delay penalties are very important. Our work concerns with the static scheduling of jobs to parallel identical batch processors for minimising the total weighted tardiness. It is assumed that the jobs are incompatible in respect of job families indicating that jobs from different families cannot be processed together. In practice, the problem cannot be solved using any classical OR algorithms in polynomial time due to the problem complexity. We develop metaheuristics, namely, the ant colony optimisation (ACO) approach to solve the problem efficiently. We propose three ant colony-based algorithms by using the structural properties of the problem. An extensive experimentation is conducted to evaluate the performance of the proposed algorithms on different problem sizes with the varied tardiness factors. Our experimentation shows that ACO-based algorithms perform better as compared to the available best dispatching rules and algorithms.

Recommendations

• scientific article; zbMATH DE number 5952318
• Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
• Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
• scientific article; zbMATH DE number 1783881
• An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups

Cited in

(6)

• A survey of scheduling with parallel batch (p-batch) processing
• Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
• Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
• scientific article; zbMATH DE number 5952318 (Why is no real title available?)
• Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework

This page was built for publication: Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families

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