Similar Search Results

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 … problem of determining an upper bound on the minimum number of processors achieved by a schedule that minimizes the makespan … for scheduling problems with communication delays. We prove that the minimum number of partitioning paths of the …

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

Graph models for scheduling systems with machine saturation property

Paolo Dell’Olmo; Gentili, Monica - In: Computational Statistics 63 (2006) 2, pp. 329-340

parallel scheduling system allows a schedule with the MS property. While for some simple models the analytical conditions can … define the class of saturated graphs that correspond to scheduling systems with the MS property. We present efficient graph …

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

An exact algorithm for scheduling identical coupled tasks

Ahr, Dino; Békési, József; Galambos, Gábor; Oswald, … - In: Computational Statistics 59 (2004) 2, pp. 193-203

delay time between them. The objective is to minimize the makespan. This problem was analyzed in depth by Orman and Potts [3 …

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

Scheduling trams in the morning

Blasum, Ulrich; Bussieck, Michael R.; Hochstättler, … - In: Computational Statistics 49 (1999) 1, pp. 137-148

In this note, we prove ??-completeness of the following problem: Given a set of trams of different types, which are stacked on sidings in their depot and an order in which trams of specified types are supposed to leave. Is there an assignment of trams to departure times without any shunting...

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

Competitive genetic algorithms for the open-shop scheduling problem

Prins, Christian - In: Computational Statistics 52 (2000) 3, pp. 389-411

For more than two machines, and when preemption is forbidden, the computation of minimum makespan schedules for the … much larger solution space, to smaller gaps between the optimal makespan and the lower bounds, and to disappointing results … population in which each individual has a distinct makespan, and a special procedure which reorders every new chromosome. Using …

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

Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time

Baptiste, Philippe; Timkovsky, Vadim G. - In: Computational Statistics 60 (2004) 1, pp. 145-153

Ideal schedules reach both minimum maximum completion time and minimum total completion time of jobs. It is known that there exist computable in polynomial time ideal nonpreemptive two-machine schedules of unit-time operation jobs with equal release dates and arbitrary precedence constraints on...

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

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

Minimizing total completion time for UET tasks with release time and outtree precedence constraints

Huo, Yumei; Leung, Joseph - In: Computational Statistics 62 (2005) 2, pp. 275-279

Brucker et al. (Math Methods Oper Res 56: 407–412, 2003) have given an O(n 2 )-time algorithm for the problems $$P \mid p_{j}=1, r_{j}$$ , outtree $$\mid \sum C_{j}$$ and $$P \mid pmtn, p_{j}=1, r_{j}$$ , outtree $$\mid \sum C_{j}$$ . In this note, we show that their algorithm admits an O(n...

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

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