Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems

DOI10.1016/J.EJOR.2024.03.004MaRDI QIDQ6572836zbMATH OpenFDO

Authors Paulo Jorge Nascimento, Cristóvão Silva, Carlos Henggeler Antunes, Samuel Moniz

Publication date 16 July 2024

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

nestingschedulingpackingadditive manufacturinglogic-based benders decomposition

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• scientific article; zbMATH DE number 1550909 (Why is no real title available?)
• A constraint programming approach for a batch processing problem with non-identical job sizes
• A new general-purpose algorithm for mixed-integer bilevel linear programs
• A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems
• A survey of scheduling with parallel batch (p-batch) processing
• A tutorial in irregular shape packing problems
• Algorithms for hybrid MILP/CP models for a class of optimization problems
• An overview on the use of operations research in additive manufacturing
• Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
• Arc-flow approach for single batch-processing machine scheduling
• Benchmarking optimization software with performance profiles.
• Complete and robust no-fit polygon generation for the irregular stock cutting problem
• Constraint programming for LNG ship scheduling and inventory management
• Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
• Logic-based Benders decomposition for large-scale optimization
• MILP models to minimise makespan in additive manufacturing machine scheduling problems
• Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing
• Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
• Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem
• Mixed-integer programming models for nesting problems
• Nesting and scheduling optimization of additive manufacturing systems: mapping the territory
• Planning and Scheduling by Logic-Based Benders Decomposition
• Robust mixed-integer linear programming models for the irregular strip packing problem
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling unrelated additive manufacturing machines with practical constraints
• Solving nesting problems with non-convex polygons by constraint logic programming
• Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints

This page was built for publication: Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572836)