نتایج جستجو برای: uniform parallel machines

تعداد نتایج: 383866  

2015

List Scheduling is an approach to finding an approximate non-preemptive schedule on parallel machines, initially due to Graham [4]. We present and analyze the approach for identical machines and an arbitrary jobs list. Then an algorithm based on the LPT (Longest Processing Time) list with an improved performance is discussed, based on [2, 5]. We stress the role of LPT schedules for determining ...

Journal: :European Journal of Operational Research 2007
Dimitrios G. Pandelis

We consider the problem of scheduling n jobs on m parallel machines. Each job has a deterministic processing time and a weight associated with it. For uniform machines we show that discounted flowtime is minimized by serving jobs preemptively in increasing order of their remaining processing times, assigning the job with the shortest remaining processing time to the fastest available machine. 2...

Journal: :Operations Research 1997
Paul Mireault James B. Orlin Rakesh V. Vohra

We consider the problem of minimizing the makespan when scheduling tasks on two uniform parallel machines, where one machine is q times as efficient on each task as is the other. We compute the maximum relative error of the LPT (largest processing time first) heuristic as an explicit function of q. In the special case that the two machines are identical (q = 1), our problem and heuristic reduce...

Journal: :Journal of Computer and System Sciences 1985

2009
Victor G. Khoroshevsky Mikhail G. Kurnosov

In most cases modern distributed computer systems (computer clusters and MPP systems) have hierarchical organization and non-uniform communication channels between elementary machines (computer nodes, processors or processor cores). Execution time of parallel programs significantly depends on how they map to computer system (on what elementary machines parallel processes are assigned and what c...

Journal: :Computational Visual Media 2023

We present angle-uniform parallel coordinates, a data-independent technique that deforms the image plane of coordinates so angles linear relationships between two variables are linearly mapped along horizontal axis plot. Despite being common method for visualizing multidimensional data, ineffective revealing positive correlations since associated points such structures may be located at infinit...

1996
Tong-Yee Lee Cauligi S. Raghavendra H. Sivaraman

Loops without dependence8 among iterations are a rich source of paTalle&sm in many applications. Among these type8 of loops, non-uniform loops with vatiable execution times need eficient scheduling schemes to take advantages of the capabilities of parallel machines. In this paper, we present a global distributed control scheme (GDC) to schedule nonuniform loops on distributed memory parallel ma...

Journal: :نشریه دانشکده فنی 0
رضا برادران کاظم زاده سیدحسام الدین ذگردی محمدعلی بهشتی نیا

this study considers scheduling in hybrid flow shop environment with unrelated parallel machines for minimizing mean of job's tardiness and mean of job's completion times. this problem does not study in the literature, so far. flexible flow shop environment is applicable in various industries such as wire and spring manufacturing, electronic industries and production lines. after mode...

Journal: :Journal of the Japan Society for Precision Engineering 1997

2014
Jihene Kaabi Youssef Harrath

This paper reviews results related to the parallel machine scheduling problem under availability constraints. The motivation of this paper comes from the fact that no survey focusing on this specific problem was published. The problems of single machine, identical, uniform, and unrelated parallel machines under different constraints and optimizing various objective functions were analyzed. For ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید