A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems

DOI10.1016/j.cor.2021.105272OpenAlexW3138103741MaRDI QIDQ2668700

Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore, Mirko Alicastro

Publication date: 7 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2021.105272

zbMATH Keywords

machine schedulingreinforcement learningadditive manufacturingiterated local searchQ-learning

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (8)

Scheduling unrelated additive manufacturing machines with practical constraints ⋮ Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping ⋮ Particle swarm optimization for integrated scheduling problem with batch additive manufacturing and batch direct-shipping delivery ⋮ Multi-constructor CMSA for the maximum disjoint dominating sets problem ⋮ A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment ⋮ An overview on the use of operations research in additive manufacturing ⋮ Variable neighborhood search: the power of change and simplicity ⋮ Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness

Uses Software

• CPLEX
• irace
• ilsts-wvcp

Cites Work

• Unnamed Item
• Unnamed Item
• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
• Integrated production and delivery on parallel batching machines
• Scheduling unrelated parallel batch processing machines with non-identical job sizes
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
• Efficient scheduling algorithms for a single batch processing machine
• Variable neighborhood search
• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
• MILP models to minimise makespan in additive manufacturing machine scheduling problems
• Improved approximation for two dimensional strip packing with polynomial bounded width
• An Exact Approach to the Strip-Packing Problem
• APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS
• Approximation Algorithms for Multiple Strip Packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
• Probabilistic stopping rules for GRASP heuristics and extensions
• A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times
• Strip Packing vs. Bin Packing

This page was built for publication: A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems