An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
From MaRDI portal
Publication:336992
DOI10.1016/J.COR.2014.01.001zbMATH Open1348.90275OpenAlexW2051022310MaRDI QIDQ336992FDOQ336992
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A survey for the quadratic assignment problem
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Makespan minimization on single batch-processing machine via ant colony optimization
- 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
- Research on batch scheduling problems with job release time based on a max-min ant system
- 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
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- 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
- A new rank based version of the ant system. -- A computational study
- Scheduling a batch processing machine with non-identical job sizes
Cited In (11)
- Arc-flow approach for single batch-processing machine scheduling
- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization
- 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
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- A hybrid neural network approach to minimize total completion time on a single batch processing machine
- A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
- Just-in-time single-batch-processing machine scheduling
- A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
- A survey of scheduling with parallel batch (p-batch) processing
This page was built for publication: An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336992)
