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.039zbMATH Open1338.90167OpenAlexW2023837024MaRDI QIDQ300033FDOQ300033
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
Recommendations
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- 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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Ant colony optimization.
- Title not available (Why is that?)
- Scheduling with batching: A review
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a batching machine
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- An Application of Bin-Packing to Multiprocessor Scheduling
- A survey for the quadratic assignment problem
- Efficient scheduling algorithms for a single batch processing machine
- 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
- 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
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- 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
Cited In (16)
- MILP models to minimise makespan in additive manufacturing machine scheduling problems
- Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel 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
- 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
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- A reinforcement learning iterated local search for makespan minimization 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
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- A survey of scheduling with parallel batch (p-batch) processing
- Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints
This page was built for publication: A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300033)
