Decomposition in single-machine scheduling.
- Published in:
- Annals of Operations Research, 1998, v. 83, n. 1-4, p. 271, doi. 10.1023/A:1018916215399
- By:
- Publication type:
- Article
Works matching IS 02545330 AND DT 1998 AND VI 83 AND IP 1-4
Results: 14
1
2
A greedy open shop heuristic with job priorities.
- Published in:
- Annals of Operations Research, 1998, v. 83, n. 1-4, p. 253, doi. 10.1023/A:1018964131329
- By:
- Publication type:
- Article
3
On the calculation of the stability radius of an optimal or an approximate schedule.
- Published in:
- Annals of Operations Research, 1998, v. 83, n. 1-4, p. 213, doi. 10.1023/A:1018960030420
- By:
- Publication type:
- Article
4
Nonstrict vector summation in multi-operation scheduling.
- Published in:
- Annals of Operations Research, 1998, v. 83, n. 1-4, p. 179, doi. 10.1023/A:1018908013582
- By:
- Publication type:
- Article
5
Practical job shop scheduling.
- Published in:
- Annals of Operations Research, 1998, v. 83, n. 1-4, p. 161, doi. 10.1023/A:1018955929512
- By:
- Publication type:
- Article
6
Parallel branch-and-bound methods for the job-shop scheduling problem.
- Published in:
- Annals of Operations Research, 1998, v. 83, n. 1-4, p. 137, doi. 10.1023/A:1018903912673
- By:
- Publication type:
- Article
7
On the solution region for certain scheduling problems with preemption.
- Published in:
- Annals of Operations Research, 1998, v. 83, n. 1-4, p. 1, doi. 10.1023/a:1018999711765
- By:
- Publication type:
- Article
8
Preface.
- Published in:
- 1998
- By:
- Publication type:
- Book Chapter
9
Heuristic procedures for parallel-machine scheduling problems with stochastic precedence constraints.
- Published in:
- Annals of Operations Research, 1998, v. 83, n. 1-4, p. 115, doi. 10.1023/A:1018951828603
- By:
- Publication type:
- Article
10
On the boolean-quadric packing uncapacitated facility-location polytope.
- Published in:
- Annals of Operations Research, 1998, v. 83, n. 1-4, p. 77, doi. 10.1023/A:1018972400378
- By:
- Publication type:
- Article
11
Batch scheduling with deadlines on parallel machines.
- Published in:
- Annals of Operations Research, 1998, v. 83, n. 1-4, p. 23, doi. 10.1023/A:1018912114491
- By:
- Publication type:
- Article
12
Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations.
- Published in:
- Annals of Operations Research, 1998, v. 83, n. 1-4, p. 95, doi. 10.1023/A:1018924517216
- By:
- Publication type:
- Article
13
Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time.
- Published in:
- Annals of Operations Research, 1998, v. 83, n. 1-4, p. 59, doi. 10.1023/A:1018920416308
- By:
- Publication type:
- Article
14
Jackson's Pseudo Preemptive Schedule for the Pm/ri, qi/Cmax scheduling problem.
- Published in:
- Annals of Operations Research, 1998, v. 83, n. 1-4, p. 41, doi. 10.1023/A:1018968332237
- By:
- Publication type:
- Article