Online interval scheduling with a bounded number of failures.
- Published in:
- Journal of Scheduling, 2017, v. 20, n. 5, p. 443, doi. 10.1007/s10951-016-0506-9
- By:
- Publication type:
- Article
Works matching IS 10946136 AND DT 2017 AND VI 20 AND IP 5
Results: 7
1
2
Mathematical models for the berth allocation problem in dry bulk terminals.
- Published in:
- Journal of Scheduling, 2017, v. 20, n. 5, p. 459, doi. 10.1007/s10951-017-0510-8
- By:
- Publication type:
- Article
3
Finding an optimal Nash equilibrium to the multi-agent project scheduling problem.
- Published in:
- Journal of Scheduling, 2017, v. 20, n. 5, p. 475, doi. 10.1007/s10951-017-0516-2
- By:
- Publication type:
- Article
4
Scheduling cleaning activities on trains by minimizing idle times.
- Published in:
- Journal of Scheduling, 2017, v. 20, n. 5, p. 493, doi. 10.1007/s10951-017-0517-1
- By:
- Publication type:
- Article
5
Crane scheduling in railway yards: an analysis of computational complexity.
- Published in:
- Journal of Scheduling, 2017, v. 20, n. 5, p. 507, doi. 10.1007/s10951-017-0520-6
- By:
- Publication type:
- Article
6
Offline first-fit decreasing height scheduling of power loads.
- Published in:
- Journal of Scheduling, 2017, v. 20, n. 5, p. 527, doi. 10.1007/s10951-017-0528-y
- By:
- Publication type:
- Article
7
Reordering buffer management with advice.
- Published in:
- Journal of Scheduling, 2017, v. 20, n. 5, p. 423, doi. 10.1007/s10951-016-0487-8
- By:
- Publication type:
- Article