Similar Search Results

Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities

Chubanov, Sergei; Pesch, Erwin - In: Computational Statistics 70 (2009) 2, pp. 313-335

. This allows us to give different interpretations related to scheduling and input–output analysis. The model may arise …

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

M/G/1/MLPS compared with M/G/1/PS within service time distribution class IMRL

Aalto, Samuli - In: Computational Statistics 64 (2006) 2, pp. 309-325

Multilevel processor-sharing (MLPS) disciplines were originally introduced by Kleinrock (in computer applications 1976) but they were forgotten for years. However, due to an application related to the service differentiation between short and long TCP flows in the Internet, they have recently...

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

Scheduling at coal handling facilities using Simulated Annealing

Conradie, David; Morison, Leilani; Joubert, Johan - In: Computational Statistics 68 (2008) 2, pp. 277-293

The main thrust of this study is the operational scheduling of the continuous coal handling and blending processes when … robust schedules in a largely stochastic environment. As the study aims to provide scheduling solutions to any coal handling …

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

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 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

Upper bound on the number of processors for scheduling with interprocessor communication delays

Moukrim, Aziz - In: Computational Statistics 52 (2000) 1, pp. 99-113

The problem of scheduling a task system with communication delays on multiprocessor systems is known to be NP-hard in … for scheduling problems with communication delays. We prove that the minimum number of partitioning paths of the …

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

A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times

Bosio, Alberto; Righini, Giovanni - In: Computational Statistics 69 (2009) 2, pp. 271-280

We consider a scheduling problem in which the processing time of each job deteriorates, i.e. it increases as time …

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

Optimal stochastic scheduling in a single server biclass retrial queueing system

Weichbold, Josef; Winkler, Anastasia - In: Computational Statistics 72 (2010) 3, pp. 405-431

The paper deals with the assignment of a single server to two retrial queues. Each customer reapplies for service after an exponentially distributed amount of time. The server operates at customer dependent exponential rates. There are holding costs and costs during service per customer and per...

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

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