Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines.
- Published in:
- Journal of Scheduling, 2019, v. 22, n. 5, p. 595, doi. 10.1007/s10951-019-00615-9
- By:
- Publication type:
- Article
Works matching IS 10946136 AND DT 2019 AND VI 22 AND IP 5
Results: 7
1
2
Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity.
- Published in:
- Journal of Scheduling, 2019, v. 22, n. 5, p. 603, doi. 10.1007/s10951-019-00613-x
- By:
- Publication type:
- Article
3
A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals.
- Published in:
- Journal of Scheduling, 2019, v. 22, n. 5, p. 517, doi. 10.1007/s10951-019-00611-z
- By:
- Publication type:
- Article
4
A unified view of parallel machine scheduling with interdependent processing rates.
- Published in:
- Journal of Scheduling, 2019, v. 22, n. 5, p. 499, doi. 10.1007/s10951-019-00605-x
- By:
- Publication type:
- Article
5
Risk-averse single machine scheduling: complexity and approximation.
- Published in:
- Journal of Scheduling, 2019, v. 22, n. 5, p. 567, doi. 10.1007/s10951-019-00599-6
- By:
- Publication type:
- Article
6
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs.
- Published in:
- Journal of Scheduling, 2019, v. 22, n. 5, p. 581, doi. 10.1007/s10951-018-0598-5
- By:
- Publication type:
- Article
7
Single-machine common due date total earliness/tardiness scheduling with machine unavailability.
- Published in:
- Journal of Scheduling, 2019, v. 22, n. 5, p. 543, doi. 10.1007/s10951-018-0585-x
- By:
- Publication type:
- Article