The evolution of schematic representations of flow shop scheduling problems.
- Published in:
- Journal of Scheduling, 2019, v. 22, n. 4, p. 379, doi. 10.1007/s10951-018-0594-9
- By:
- Publication type:
- Article
Works matching IS 10946136 AND DT 2019 AND VI 22 AND IP 4
Results: 8
1
2
Lower bounds for online bin covering-type problems.
- Published in:
- Journal of Scheduling, 2019, v. 22, n. 4, p. 487, doi. 10.1007/s10951-018-0590-0
- By:
- Publication type:
- Article
3
Quality of strong equilibria for selfish bin packing with uniform cost sharing.
- Published in:
- Journal of Scheduling, 2019, v. 22, n. 4, p. 473, doi. 10.1007/s10951-018-0587-8
- By:
- Publication type:
- Article
4
Unbounded parallel-batch scheduling with drop-line tasks.
- Published in:
- Journal of Scheduling, 2019, v. 22, n. 4, p. 449, doi. 10.1007/s10951-018-0586-9
- By:
- Publication type:
- Article
5
Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs.
- Published in:
- Journal of Scheduling, 2019, v. 22, n. 4, p. 413, doi. 10.1007/s10951-018-0584-y
- By:
- Publication type:
- Article
6
The single-processor scheduling problem with time restrictions: complexity and related problems.
- Published in:
- Journal of Scheduling, 2019, v. 22, n. 4, p. 465, doi. 10.1007/s10951-018-0579-8
- By:
- Publication type:
- Article
7
Malleable scheduling for flows of jobs and applications to MapReduce.
- Published in:
- Journal of Scheduling, 2019, v. 22, n. 4, p. 393, doi. 10.1007/s10951-018-0576-y
- By:
- Publication type:
- Article
8
Parallel machine makespan minimization subject to machine availability and total completion time constraints.
- Published in:
- Journal of Scheduling, 2019, v. 22, n. 4, p. 433, doi. 10.1007/s10951-017-0551-z
- By:
- Publication type:
- Article