Similar Search Results

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

Chubanov, Sergei; Pesch, Erwin - In: Mathematical Methods of Operations Research 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/10010949919

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

Aalto, Samuli - In: Mathematical Methods of Operations Research 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/10010949936

Scheduling at coal handling facilities using Simulated Annealing

Conradie, David; Morison, Leilani; Joubert, Johan - In: Mathematical Methods of Operations Research 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/10010949959

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

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

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

Moukrim, Aziz - In: Mathematical Methods of Operations Research 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/10010950109

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

Bosio, Alberto; Righini, Giovanni - In: Mathematical Methods of Operations Research 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/10010950299

Optimal stochastic scheduling in a single server biclass retrial queueing system

Weichbold, Josef; Winkler, Anastasia - In: Mathematical Methods of Operations Research 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/10010950341

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

No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems

Schuster, Christoph - In: Mathematical Methods of Operations Research 63 (2006) 3, pp. 473-491

This paper deals with the no-wait job shop problem with a makespan objective. We present some new theoretical properties on the complexity of subproblems associated with a well-known decomposition approach. Justified by the complexity results, we implement a fast tabu search algorithm for the...

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