Makespan minimization on single batch-processing machine via ant colony optimization

DOI10.1016/j.cor.2011.05.011zbMath1251.90201OpenAlexW2032302696MaRDI QIDQ1762006

Huaping Chen, Rui Xu, Xue-Ping Li

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.05.011

zbMATH Keywords

schedulingant colony optimizationbatch-processing machine\texttt{CPLEX}makespan \((C_{\max})\)

Mathematics Subject Classification ID

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

Related Items (18)

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 ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes ⋮ An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes ⋮ A new approach for maintenance scheduling of generating units in electrical power systems based on their operational hours ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system ⋮ Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ Just-in-time single-batch-processing machine scheduling ⋮ Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices ⋮ A hybrid neural network approach to minimize total completion time on a single batch processing machine ⋮ Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization ⋮ Scheduling batch processing machine using max-min ant system algorithm improved by a local search method ⋮ The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs ⋮ Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes ⋮ Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm ⋮ Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines ⋮ A survey of scheduling with parallel batch (p-batch) processing

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
• Minimizing number of tardy jobs on a batch processing machine with incompatible job families
• A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
• Ant colony optimization combined with taboo search for the job shop scheduling problem
• Efficient scheduling algorithms for a single batch processing machine
• Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
• Batching identical jobs
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing
• An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
• Scheduling with batching: A review
• Ant colony optimization for solving an industrial layout problem
• An improved ant colony optimization for vehicle routing problem
• An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
• Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems
• Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
• Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Heuristic scheduling of jobs on a multi-product batch processing machine
• Dynamic job assignment heuristics for multi-server batch operations- A cost based approach
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Control of a batch-processing machine: A computational approach
• Scheduling a single batch processing machine with non-identical job sizes
• Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
• Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes

This page was built for publication: Makespan minimization on single batch-processing machine via ant colony optimization