Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems
From MaRDI portal
Publication:6572836
DOI10.1016/j.ejor.2024.03.004MaRDI QIDQ6572836
Paulo Jorge Nascimento, Carlos Henggeler Antunes, Samuel Moniz, Cristóvão Silva
Publication date: 16 July 2024
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
- Robust mixed-integer linear programming models for the irregular strip packing problem
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- MILP models to minimise makespan in additive manufacturing machine scheduling problems
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- A constraint programming approach for a batch processing problem with non-identical job sizes
- A survey of scheduling with parallel batch (p-batch) processing
- Scheduling unrelated additive manufacturing machines with practical constraints
- Mixed-integer programming models for nesting problems
- Constraint programming for LNG ship scheduling and inventory management
- Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem
- Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems
- Arc-flow approach for single batch-processing machine scheduling
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Logic-Based Benders Decomposition for Large-Scale Optimization
- Planning and Scheduling by Logic-Based Benders Decomposition
- A tutorial in irregular shape packing problems
- Scheduling a single batch processing machine with non-identical job sizes
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- Solving nesting problems with non-convex polygons by constraint logic programming
- Benchmarking optimization software with performance profiles.
- An overview on the use of operations research in additive manufacturing
- Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints
- Nesting and scheduling optimization of additive manufacturing systems: mapping the territory
This page was built for publication: Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems