Narrow search
Showing 1 - 10 of 14
Cover Image
Scheduling chains with identical jobs and constant delays on a single machine
Brucker, Peter; Knust, Sigrid; Oğuz, Ceyda - In: Computational Statistics 63 (2006) 1, pp. 63-75
In this paper we study the single-machine problem 1|chains(l), p j =p|∑ C j in which jobs with constant processing times and generalized precedence constraints in form of chains with constant delays are given. One has to schedule the jobs on a single machine such that all delays between...
Persistent link: https://www.econbiz.de/10010759518
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 …
Persistent link: https://www.econbiz.de/10010847527
Cover Image
Scheduling UET task systems with concurrency on two parallel identical processors
Brucker, Peter; Knust, Sigrid; Roper, Duncan; Zinder, Yakov - In: Computational Statistics 52 (2000) 3, pp. 369-387
in scheduling theory. In contrast to the conventional models, where each task requires only one processor, we consider a …
Persistent link: https://www.econbiz.de/10010847568
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 …
Persistent link: https://www.econbiz.de/10010847645
Cover Image
Preemptive job-shop scheduling problems with a fixed number of jobs
Brucker, Peter; Kravchenko, Svetlana A.; Sotskov, Yuri N. - In: Computational Statistics 49 (1999) 1, pp. 41-76
It is shown that the two machine preemptive job-shop problem with mean flow-time or makespan objective function and three jobs is NP-hard. This contrasts the fact that the nonpreemptive versions of these problems are polynomially solvable if the number of jobs is arbitrary but fixed. It is also...
Persistent link: https://www.econbiz.de/10010847987
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 …
Persistent link: https://www.econbiz.de/10010999571
Cover Image
Scheduling chains with identical jobs and constant delays on a single machine
Brucker, Peter; Knust, Sigrid; Oğuz, Ceyda - In: Mathematical Methods of Operations Research 63 (2006) 1, pp. 63-75
In this paper we study the single-machine problem 1|chains(l), p <Subscript> j </Subscript>=p|∑ C <Subscript> j </Subscript> in which jobs with constant processing times and generalized precedence constraints in form of chains with constant delays are given. One has to schedule the jobs on a single machine such that all delays between...</subscript></subscript>
Persistent link: https://www.econbiz.de/10010999926
Cover Image
Scheduling UET task systems with concurrency on two parallel identical processors
Brucker, Peter; Knust, Sigrid; Roper, Duncan; Zinder, Yakov - In: Mathematical Methods of Operations Research 52 (2000) 3, pp. 369-387
in scheduling theory. In contrast to the conventional models, where each task requires only one processor, we consider a …
Persistent link: https://www.econbiz.de/10010949999
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 …
Persistent link: https://www.econbiz.de/10010950064
Cover Image
Preemptive job-shop scheduling problems with a fixed number of jobs
Brucker, Peter; Kravchenko, Svetlana A.; Sotskov, Yuri N. - In: Mathematical Methods of Operations Research 49 (1999) 1, pp. 41-76
It is shown that the two machine preemptive job-shop problem with mean flow-time or makespan objective function and three jobs is NP-hard. This contrasts the fact that the nonpreemptive versions of these problems are polynomially solvable if the number of jobs is arbitrary but fixed. It is also...
Persistent link: https://www.econbiz.de/10010950358