Similar Search Results

Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences

Cheng, T. C. E.; Kravčenko, Svetlana A.; Lin, Bertrand … - In: Journal of the Operational Research Society 72 (2021) 10, pp. 2286-2289

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

On scheduling of step-improving jobs to minimize the total weighted completion time

Cheng, T. C. E.; Kravčenko, Svetlana A.; Lin, Bertrand … - In: Journal of the Operational Research Society 75 (2024) 4, pp. 720-730

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

Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations

Elidrissi, Abdelhak; Benmansour, Rachid; Hasani, Keramat; … - In: Computers & operations research : an international journal 167 (2024), pp. 1-20

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

Minimizing the number of machines for scheduling jobs with equal processing times

Kravchenko, Svetlana A.; Werner, Frank - In: European Journal of Operational Research 199 (2009) 2, pp. 595-600

In this paper, we consider a parallel machine environment when all jobs have the same processing time and arbitrary release dates and deadlines of the jobs are given. We suppose that the available number of machines, which can be used simultaneously, may vary over time. The aim is to construct a...

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

Server scheduling on parallel dedicated machines with fixed job sequences

Cheng, T.C.E.; Kravchenko, Svetlana A.; Lin, Bertrand M. T. - In: Naval Research Logistics (NRL) 66 (2019) 4, pp. 321-332

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

A polynomial algorithm for a two-machine no-wait job-shop scheduling problem

Kravchenko, Svetlana A. - In: European Journal of Operational Research 106 (1998) 1, pp. 101-107

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

Two-machine shop scheduling with zero and unit processing times

Lushchakova, Irene N.; Kravchenko, Svetlana A. - In: European Journal of Operational Research 107 (1998) 2, pp. 378-388

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

Complexity of shop-scheduling problems with fixed number of jobs: a survey

Brucker, Peter; Sotskov, Yu; Werner, Frank - In: Computational Statistics 65 (2007) 3, pp. 461-481

The paper surveys the complexity results for job shop, flow shop, open shop and mixed shop scheduling problems when the number n of jobs is fixed while the number r of operations per job is not restricted. In such cases, the asymptotical complexity of scheduling algorithms depends on the number...

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

Book Review: Michael L. Pinedo (2005): ISBN 0-387-22198-0, Springer, New York

Werner, Frank - In: Mathematical Methods of Operations Research 63 (2006) 1, pp. 187-189

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

Complexity of shop-scheduling problems with fixed number of jobs: a survey

Brucker, Peter; Sotskov, Yu; Werner, Frank - In: Mathematical Methods of Operations Research 65 (2007) 3, pp. 461-481

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