A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses.
- Published in:
- Journal of Scheduling, 2024, v. 27, n. 4, p. 393, doi. 10.1007/s10951-024-00811-2
- By:
- Publication type:
- Article
Works matching IS 10946136 AND DT 2024 AND VI 27 AND IP 4
Results: 6
1
2
Sequential solutions in machine scheduling games.
- Published in:
- Journal of Scheduling, 2024, v. 27, n. 4, p. 363, doi. 10.1007/s10951-024-00810-3
- By:
- Publication type:
- Article
3
Continuity of care in home health care scheduling: a rolling horizon approach.
- Published in:
- Journal of Scheduling, 2024, v. 27, n. 4, p. 375, doi. 10.1007/s10951-023-00796-4
- By:
- Publication type:
- Article
4
Block-based state-expanded network models for multi-activity shift scheduling.
- Published in:
- Journal of Scheduling, 2024, v. 27, n. 4, p. 341, doi. 10.1007/s10951-023-00789-3
- By:
- Publication type:
- Article
5
An exact solution with an improved running time for the routing flow shop problem with two machines.
- Published in:
- Journal of Scheduling, 2024, v. 27, n. 4, p. 329, doi. 10.1007/s10951-023-00784-8
- By:
- Publication type:
- Article
6
Approximating weighted completion time via stronger negative correlation.
- Published in:
- Journal of Scheduling, 2024, v. 27, n. 4, p. 319, doi. 10.1007/s10951-023-00780-y
- By:
- Publication type:
- Article