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 QIDQ6572836FDOQ6572836
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)
Cites Work
- Benchmarking optimization software with performance profiles.
- Mixed-integer programming models for nesting problems
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- Planning and Scheduling by Logic-Based Benders Decomposition
- A constraint programming approach for a batch processing problem with non-identical 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
- Title not available (Why is that?)
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- Constraint programming for LNG ship scheduling and inventory management
- Algorithms for hybrid MILP/CP models for a class of optimization problems
- 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
- A tutorial in irregular shape packing problems
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem
- Solving nesting problems with non-convex polygons by constraint logic programming
- MILP models to minimise makespan in additive manufacturing machine scheduling problems
- A survey of scheduling with parallel batch (p-batch) processing
- Arc-flow approach for single batch-processing machine scheduling
- Logic-based Benders decomposition for large-scale optimization
- Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing
- An overview on the use of operations research in additive manufacturing
- Scheduling unrelated additive manufacturing machines with practical constraints
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572836)