Similar Search Results

Classification scheme for integrated staff rostering and scheduling problems

Paul, Mareike; Knust, Sigrid - In: RAIRO / Operations research 49 (2015) 2, pp. 393-412

Persistent link: https://www.econbiz.de/10011309420

Decomposition algorithms for synchronous flow shop problems with additional resources and setup times

Waldherr, Stefan; Knust, Sigrid - In: European journal of operational research : EJOR 259 (2017) 3, pp. 847-863

Persistent link: https://www.econbiz.de/10011695209

A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization

Meignan, David; Knust, Sigrid - In: European journal of operational research : EJOR 279 (2019) 2, pp. 320-334

Persistent link: https://www.econbiz.de/10012110701

Flow shop scheduling with flexible processing times

Bultmann, Matthias; Knust, Sigrid; Waldherr, Stefan - In: OR spectrum : quantitative approaches in management 40 (2018) 3, pp. 809-829

Persistent link: https://www.econbiz.de/10011876682

Synchronous flow shop scheduling with pliable jobs

Bultmann, Matthias; Knust, Sigrid; Waldherr, Stefan - In: European journal of operational research : EJOR 270 (2018) 3, pp. 943-956

Persistent link: https://www.econbiz.de/10011882671

Shop scheduling problems with pliable jobs

Knust, Sigrid; Shakhlevich, Natasha; Waldherr, Stefan; … - In: Journal of scheduling 22 (2019) 6, pp. 635-661

Persistent link: https://www.econbiz.de/10012125310

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

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

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

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