An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes

DOI10.1016/j.cor.2014.01.001zbMath1348.90275OpenAlexW2051022310MaRDI QIDQ336992

Zhao-hong Jia, Joseph Y.-T. Leung

Publication date: 10 November 2016

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

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

zbMATH Keywords

NP-hardmeta-heuristicbatch machinesmax-min ant system

Mathematics Subject Classification ID

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

Related Items (9)

Integrated production and transportation on parallel batch machines to minimize total weighted delivery time ⋮ Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times ⋮ Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system ⋮ Arc-flow approach for single batch-processing machine scheduling ⋮ Just-in-time single-batch-processing machine scheduling ⋮ 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 ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes

Cites Work

• Unnamed Item
• A survey for the quadratic assignment problem
• A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
• A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing
• Makespan minimization on single batch-processing machine via ant colony optimization
• A new rank based version of the ant system. -- A computational study
• Minimizing makespan on a single batching machine with release times and non-identical job sizes
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling a 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
• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure

This page was built for publication: An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes