A greedy approximation algorithm for minimum-gap scheduling.
- Published in:
- Journal of Scheduling, 2017, v. 20, n. 3, p. 279, doi. 10.1007/s10951-016-0492-y
- By:
- Publication type:
- Article
Works matching IS 10946136 AND DT 2017 AND VI 20 AND IP 3
Results: 7
1
2
Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence.
- Published in:
- Journal of Scheduling, 2017, v. 20, n. 3, p. 293, doi. 10.1007/s10951-016-0493-x
- By:
- Publication type:
- Article
3
The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays.
- Published in:
- Journal of Scheduling, 2017, v. 20, n. 3, p. 303, doi. 10.1007/s10951-016-0507-8
- By:
- Publication type:
- Article
4
The local-global conjecture for scheduling with non-linear cost.
- Published in:
- Journal of Scheduling, 2017, v. 20, n. 3, p. 239, doi. 10.1007/s10951-015-0466-5
- By:
- Publication type:
- Article
5
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack.
- Published in:
- Journal of Scheduling, 2017, v. 20, n. 3, p. 255, doi. 10.1007/s10951-016-0478-9
- By:
- Publication type:
- Article
6
Optimal scheduling of contract algorithms with soft deadlines.
- Published in:
- Journal of Scheduling, 2017, v. 20, n. 3, p. 267, doi. 10.1007/s10951-016-0483-z
- By:
- Publication type:
- Article
7
Continuous-time production, distribution and financial planning with periodic liquidity balancing.
- Published in:
- Journal of Scheduling, 2017, v. 20, n. 3, p. 219, doi. 10.1007/s10951-016-0488-7
- By:
- Publication type:
- Article