A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
From MaRDI portal
Publication:300033
DOI10.1016/j.ejor.2014.07.039zbMath1338.90167OpenAlexW2023837024MaRDI QIDQ300033
Joseph Y.-T. Leung, Zhao-hong Jia
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.07.039
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (14)
Integrated production and transportation on parallel batch machines to minimize total weighted delivery time ⋮ Integrated scheduling on parallel batch processing machines with non-identical capacities ⋮ Integrated production and delivery on parallel batching machines ⋮ Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times ⋮ A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems ⋮ Exact algorithms to minimize makespan on single and parallel batch processing machines ⋮ Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time ⋮ Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization ⋮ MILP models to minimise makespan in additive manufacturing machine scheduling problems ⋮ The piggyback transportation problem: transporting drones launched from a flying warehouse ⋮ 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 ⋮ A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
Cites Work
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- A survey for the quadratic assignment problem
- A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families
- Efficient scheduling algorithms for a single batch processing machine
- Scheduling a batching machine
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Makespan minimization on single batch-processing machine via ant colony optimization
- Scheduling with batching: A review
- 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
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- An Application of Bin-Packing to Multiprocessor Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling batch processing machines with incompatible job families
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
