A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job.
- Published in:
- Journal of Scheduling, 2016, v. 19, n. 1, p. 61, doi. 10.1007/s10951-015-0454-9
- By:
- Publication type:
- Article
Works matching IS 10946136 AND DT 2016 AND VI 19 AND IP 1
Results: 8
1
2
A genetic algorithm for the robust resource leveling problem.
- Published in:
- Journal of Scheduling, 2016, v. 19, n. 1, p. 43, doi. 10.1007/s10951-015-0457-6
- By:
- Publication type:
- Article
3
MP or not MP: that is the question.
- Published in:
- Journal of Scheduling, 2016, v. 19, n. 1, p. 33, doi. 10.1007/s10951-015-0459-4
- By:
- Publication type:
- Article
4
A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines.
- Published in:
- Journal of Scheduling, 2016, v. 19, n. 1, p. 21, doi. 10.1007/s10951-015-0460-y
- By:
- Publication type:
- Article
5
A mixed integer programming approach to multi-skilled workforce scheduling.
- Published in:
- Journal of Scheduling, 2016, v. 19, n. 1, p. 91, doi. 10.1007/s10951-015-0450-0
- By:
- Publication type:
- Article
6
A survey of offline algorithms for energy minimization under deadline constraints.
- Published in:
- Journal of Scheduling, 2016, v. 19, n. 1, p. 3, doi. 10.1007/s10951-015-0463-8
- By:
- Publication type:
- Article
7
A graph coloring approach to the deployment scheduling and unit assignment problem.
- Published in:
- Journal of Scheduling, 2016, v. 19, n. 1, p. 73, doi. 10.1007/s10951-015-0434-0
- By:
- Publication type:
- Article
8
Journal of Scheduling (2016).
- Published in:
- 2016
- By:
- Publication type:
- Editorial