Makespan minimization on single batch-processing machine via ant colony optimization
From MaRDI portal
Publication:1762006
DOI10.1016/J.COR.2011.05.011zbMATH Open1251.90201OpenAlexW2032302696MaRDI QIDQ1762006FDOQ1762006
Authors: Rui Xu, Huaping Chen, Xueping 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
Recommendations
- An improved ant colony algorithm for solving batch scheduling problems with non-identical job sizes
- An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
- Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Scheduling batch processing machine using max-min ant system algorithm improved by a local search method
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)
Cites Work
- Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
- Ant colony optimization.
- Scheduling with batching: A review
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Ant colony optimization combined with taboo search for the job shop scheduling problem
- Efficient scheduling algorithms for a single batch processing machine
- Batching identical jobs
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Scheduling a single batch processing machine with non-identical job sizes
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- 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
- An improved ant colony optimization for vehicle routing problem
- An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- Ant colony optimization for solving an industrial layout problem
- Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
- Control of a batch-processing machine: A computational approach
- Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
- Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems
- Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
- Heuristic scheduling of jobs on a multi-product batch processing machine
- Dynamic job assignment heuristics for multi-server batch operations- A cost based approach
Cited In (22)
- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization
- The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs
- 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
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- An improved ant colony algorithm for solving batch scheduling problems with non-identical job sizes
- 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
- A new approach for maintenance scheduling of generating units in electrical power systems based on their operational hours
- Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm
- A hybrid neural network approach to minimize total completion time on a single batch processing machine
- An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
- Single batch machine scheduling with dual setup times for autoclave molding manufacturing
- Just-in-time single-batch-processing machine scheduling
- Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices
- Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
- A survey of scheduling with parallel batch (p-batch) processing
- Research on batch scheduling problems with job release time based on a max-min ant system
- Scheduling batch processing machine using max-min ant system algorithm improved by a local search method
Uses Software
This page was built for publication: Makespan minimization on single batch-processing machine via ant colony optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762006)
