Online scheduling with preemption or non-completion penalties.
- Published in:
- Journal of Scheduling, 2014, v. 17, n. 2, p. 173, doi. 10.1007/s10951-013-0321-5
- By:
- Publication type:
- Article
Works matching IS 10946136 AND DT 2014 AND VI 17 AND IP 2
Results: 7
1
2
The optimal number of used machines in a two-stage flexible flowshop scheduling problem.
- Published in:
- Journal of Scheduling, 2014, v. 17, n. 2, p. 199, doi. 10.1007/s10951-013-0343-z
- By:
- Publication type:
- Article
3
Approximation schemes for single machine scheduling with non-renewable resource constraints.
- Published in:
- Journal of Scheduling, 2014, v. 17, n. 2, p. 135, doi. 10.1007/s10951-013-0346-9
- By:
- Publication type:
- Article
4
The total adjustment cost problem: Applications, models, and solution algorithms.
- Published in:
- Journal of Scheduling, 2014, v. 17, n. 2, p. 145, doi. 10.1007/s10951-013-0344-y
- By:
- Publication type:
- Article
5
A sequential GRASP for the therapist routing and scheduling problem.
- Published in:
- Journal of Scheduling, 2014, v. 17, n. 2, p. 109, doi. 10.1007/s10951-013-0345-x
- By:
- Publication type:
- Article
6
A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem.
- Published in:
- Journal of Scheduling, 2014, v. 17, n. 2, p. 185, doi. 10.1007/s10951-013-0338-9
- By:
- Publication type:
- Article
7
Minimizing total weighted completion time with an unexpected machine unavailable interval.
- Published in:
- Journal of Scheduling, 2014, v. 17, n. 2, p. 161, doi. 10.1007/s10951-013-0328-y
- By:
- Publication type:
- Article