Approximate and robust bounded job start scheduling for Royal Mail delivery offices.
- Published in:
- Journal of Scheduling, 2021, v. 24, n. 2, p. 237, doi. 10.1007/s10951-021-00678-7
- By:
- Publication type:
- Article
Works matching IS 10946136 AND DT 2021 AND VI 24 AND IP 2
Results: 7
1
2
Coupled task scheduling with time-dependent processing times.
- Published in:
- Journal of Scheduling, 2021, v. 24, n. 2, p. 223, doi. 10.1007/s10951-020-00675-2
- By:
- Publication type:
- Article
3
Scheduling coupled tasks with exact delays for minimum total job completion time.
- Published in:
- Journal of Scheduling, 2021, v. 24, n. 2, p. 209, doi. 10.1007/s10951-020-00668-1
- By:
- Publication type:
- Article
4
Stochastic programming approach for unidirectional quay crane scheduling problem with uncertainty.
- Published in:
- Journal of Scheduling, 2021, v. 24, n. 2, p. 137, doi. 10.1007/s10951-020-00661-8
- By:
- Publication type:
- Article
5
Multiple dispatching rules allocation in real time using data mining, genetic algorithms, and simulation.
- Published in:
- Journal of Scheduling, 2021, v. 24, n. 2, p. 175, doi. 10.1007/s10951-020-00664-5
- By:
- Publication type:
- Article
6
Three-machine open shop with a bottleneck machine revisited.
- Published in:
- Journal of Scheduling, 2021, v. 24, n. 2, p. 197, doi. 10.1007/s10951-020-00652-9
- By:
- Publication type:
- Article
7
Cyclic lot-sizing problems with sequencing costs.
- Published in:
- Journal of Scheduling, 2021, v. 24, n. 2, p. 123, doi. 10.1007/s10951-020-00645-8
- By:
- Publication type:
- Article