A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
From MaRDI portal
Publication:2335532
DOI10.1016/J.AMC.2018.04.024zbMATH Open1427.90166OpenAlexW2801954026WikidataQ129885005 ScholiaQ129885005MaRDI QIDQ2335532FDOQ2335532
Authors: Shengchao Zhou, Jianhui Xie, Ni Du, Yan Pang 
Publication date: 14 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.04.024
Recommendations
- Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints
- A genetic local search algorithm for the parallel machine batch process scheduling problem
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- Effectiveness of adaptive crossover procedures for a genetic algorithm to schedule unrelated parallel machines with setups
- A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems
- Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
- A Genetic Algorithm for the Batch Scheduling with Sequence-Dependent Setup Times
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Scheduling a batching machine
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Efficient scheduling algorithms for a single batch processing machine
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- 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
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- 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
- Scheduling unrelated 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
- Feature Article—Genetic Algorithms for the Operations Researcher
- Scheduling with agreeable release times and due dates on a batch processing machine
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
- Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
- Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations
- An adaptive estimation of distribution algorithm for solving the unrelated parallel machine scheduling
Cited In (9)
- 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
- Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints
- Scheduling unrelated additive manufacturing machines with practical constraints
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- Single batch machine scheduling with dual setup times for autoclave molding manufacturing
- Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
- Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints
Uses Software
This page was built for publication: A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2335532)
