Scheduling unrelated additive manufacturing machines with practical constraints
DOI10.1016/J.COR.2022.105847OpenAlexW4224311541WikidataQ114193069 ScholiaQ114193069MaRDI QIDQ2147124FDOQ2147124
Authors: Kanxin Hu, Yuxin Che, Zhenzhen Zhang
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105847
Recommendations
- Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing
- MILP models to minimise makespan in additive manufacturing machine scheduling problems
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems
- A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing
- Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time
two-dimensional packingadditive manufacturingunrelated parallel batch machinespart orientation selectionunequal release times
Cites Work
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study
- An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
- Scheduling identical parallel machines with tooling constraints
- MILP models to minimise makespan in additive manufacturing machine scheduling problems
- Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing
- Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm
- A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems
- Optimal part deposition orientation in FDM by using a multicriteria genetic algorithm
Cited In (5)
- Nesting and scheduling optimization of additive manufacturing systems: mapping the territory
- Iterated variable neighborhood search for integrated scheduling of additive manufacturing and multi-trip vehicle routing problem
- Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems
- Particle swarm optimization for integrated scheduling problem with batch additive manufacturing and batch direct-shipping delivery
- Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints
Uses Software
This page was built for publication: Scheduling unrelated additive manufacturing machines with practical constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147124)