An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
From MaRDI portal
(Redirected from Publication:336992)
Recommendations
- An improved ant colony algorithm for solving batch scheduling problems with non-identical job sizes
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Makespan minimization on single batch-processing machine via ant colony optimization
Cites work
- A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
- A new rank based version of the ant system. -- A computational study
- A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
- A survey for the quadratic assignment problem
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Makespan minimization on single batch-processing machine via ant colony optimization
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Research on batch scheduling problems with job release time based on a max-min ant system
- Scheduling a batch processing machine with non-identical job sizes
- Scheduling a single batch processing machine with non-identical job sizes
Cited in
(17)- 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
- A hybrid neural network approach to minimize total completion time on a single batch processing machine
- Integrated production and transportation on parallel batch machines to minimize total weighted delivery time
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Just-in-time single-batch-processing machine scheduling
- A survey of scheduling with parallel batch (p-batch) processing
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
- An improved ant colony algorithm for solving batch scheduling problems with non-identical job sizes
- A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
- A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
- Makespan minimization on single batch-processing machine via ant colony optimization
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- Scheduling batch processing machine using max-min ant system algorithm improved by a local search method
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- 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
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)
