Pages that link to "Item:Q2668700"
From MaRDI portal
The following pages link to A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems (Q2668700):
Displaying 13 items.
- MILP models to minimise makespan in additive manufacturing machine scheduling problems (Q1722963) (← links)
- Scheduling unrelated additive manufacturing machines with practical constraints (Q2147124) (← links)
- Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing (Q2668671) (← links)
- Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping (Q6063502) (← links)
- Particle swarm optimization for integrated scheduling problem with batch additive manufacturing and batch direct-shipping delivery (Q6065621) (← links)
- Multi-constructor CMSA for the maximum disjoint dominating sets problem (Q6065657) (← links)
- A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment (Q6090150) (← links)
- An overview on the use of operations research in additive manufacturing (Q6099430) (← links)
- Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
- Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness (Q6167662) (← links)
- Nesting and scheduling optimization of additive manufacturing systems: mapping the territory (Q6561243) (← links)
- Iterated variable neighborhood search for integrated scheduling of additive manufacturing and multi-trip vehicle routing problem (Q6568473) (← links)
- Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems (Q6572836) (← links)
