Narrow search
Showing 1 - 10 of 107
Cover Image
Job-shop scheduling with limited capacity buffers
Brucker, Peter; Heitmann, Silvia; Hurink, Johann; … - In: OR spectrum : quantitative approaches in management 28 (2006) 2, pp. 151-176
Persistent link: https://www.econbiz.de/10006808934
Cover Image
Flow-shop problems with intermediate buffers
Brucker, Peter; Heitmann, Silvia; Hurink, Johann - In: OR spectrum : quantitative approaches in management 25 (2003) 4, pp. 549-574
Persistent link: https://www.econbiz.de/10001813629
Cover Image
Flow-shop problems with intermediate buffers
Brucker, Peter; Heitmann, Silvia; Hurink, Johann - In: OR spectrum : quantitative approaches in management 25 (2003) 4, pp. 549-574
Persistent link: https://www.econbiz.de/10006821031
Cover Image
How useful are preemptive schedules?
Brucker, Peter; Heitmann, Silvia; Hurink, Johann - In: Operations research letters 31 (2003) 2, pp. 129-136
Persistent link: https://www.econbiz.de/10006823886
Cover Image
Scheduling railway traffic at a construction site
Brucker, Peter; Heitmann, Silvia; Knust, Sigrid - In: OR spectrum : quantitative approaches in management 24 (2002) 1, pp. 19-30
Persistent link: https://www.econbiz.de/10001662721
Cover Image
Scheduling railway traffic at a construction site
Brucker, Peter; Heitmann, Silvia; Knust, Sigrid - In: OR spectrum : quantitative approaches in management 24 (2002) 1, pp. 19-30
Persistent link: https://www.econbiz.de/10006828951
Cover Image
A polynomial algorithm for P | p j=1, r j, outtree | ∑ C j
Brucker, Peter; Hurink, Johann; Knust, Sigrid - In: Computational Statistics 56 (2003) 3, pp. 407-412
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was open. A set of jobs with unit processing times, release dates and outtree precedence relations has to be processed on parallel identical machines such that the total completion time ∑ C j is...
Persistent link: https://www.econbiz.de/10010847527
Cover Image
Scheduling identical jobs with chain precedence constraints on two uniform machines
Brucker, Peter; Hurink, Johann; Kubiak, Wieslaw - In: Computational Statistics 49 (1999) 2, pp. 211-219
The problem of scheduling identical jobs with chain precedence constraints on two uniform machines is considered. It is shown that the corresponding makespan problem can be solved in linear time. Copyright Springer-Verlag Berlin Heidelberg 1999
Persistent link: https://www.econbiz.de/10010847645
Cover Image
A polynomial algorithm for P | p<Subscript>j</Subscript>=1, r<Subscript>j</Subscript>, outtree | ∑ C<Subscript>j</Subscript>
Brucker, Peter; Hurink, Johann; Knust, Sigrid - In: Mathematical Methods of Operations Research 56 (2003) 3, pp. 407-412
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was open. A set of jobs with unit processing times, release dates and outtree precedence relations has to be processed on parallel identical machines such that the total completion time ∑ C <Subscript>j</Subscript> is...</subscript>
Persistent link: https://www.econbiz.de/10010999571
Cover Image
Scheduling identical jobs with chain precedence constraints on two uniform machines
Brucker, Peter; Hurink, Johann; Kubiak, Wieslaw - In: Mathematical Methods of Operations Research 49 (1999) 2, pp. 211-219
The problem of scheduling identical jobs with chain precedence constraints on two uniform machines is considered. It is shown that the corresponding makespan problem can be solved in linear time. Copyright Springer-Verlag Berlin Heidelberg 1999
Persistent link: https://www.econbiz.de/10010950064