A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes

DOI10.1016/J.AMC.2018.04.024zbMath1427.90166OpenAlexW2801954026WikidataQ129885005 ScholiaQ129885005MaRDI QIDQ2335532

Jianhui Xie, Ni Du, Shengchao Zhou, 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

zbMATH Keywords

schedulingunrelated parallel machinesbatch processing machinesrandom-keys genetic algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

Scheduling unrelated additive manufacturing machines with practical constraints ⋮ Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ 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 ⋮ Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints ⋮ Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
• 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
• Efficient scheduling algorithms for a single batch processing machine
• Scheduling a batching machine
• Scheduling with agreeable release times and due dates on a batch processing machine
• Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing
• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
• 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
• Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
• Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Feature Article—Genetic Algorithms for the Operations Researcher
• Scheduling a single batch processing machine with non-identical job sizes
• Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations
• Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
• 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

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