نتایج جستجو برای: split job size

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

2010
Heeso Noh Jin-Kyu Yang Ilya Vitebskiy Alex Figotin Hui Cao

We conduct a numerical study on the giant optical resonances near the split photonic band edges of twodimensional square lattices. Their quality factors are 1 order of magnitude higher than those near the regular band edges. Such enhancement results from the efficient interference of multiple Bloch waves, which minimizes light leakage from the periodic pattern of finite size. The variation of t...

2013
Yuri N. Sotskov Omid Gholami Frank Werner

A learning stage of scheduling tends to produce knowledge about a benchmark of priority dispatching rules which allows a scheduler to improve the solution quality for a set of similar job-shop problems. Once trained on the sample job-shop problems (usually with small sizes), the adaptive algorithm solves a similar job-shop problem (with a moderate size or a large size) better than heuristics us...

Journal: :Operations Research 2012
Adam Wierman Bert Zwart

This paper focuses on the competitive analysis of scheduling disciplines in a large deviations setting. Though there are policies that are known to optimize the sojourn time tail under a large class of heavy-tailed job sizes (e.g. Processor Sharing and Shortest Remaining Processing Time) and there are policies known to optimize the sojourn time tail in the case of light-tailed job sizes (e.g. F...

2011
Hiwa Farughi

Flexibility in job shop scheduling is a main problem that has been considered by many of researchers in recent years.So Scheduling for the flexible job shop is very important in the field of production management and combinatorial optimization. However, it is quite difficult to achieve an optimal solution to this problem in medium and actual size problems with traditional optimization approache...

2009
Ingo Geishecker

This paper analyzes the impact of job insecurity perceptions on individual well-being. While previous studies on the subject have used the concept of perceived job insecurity rather arbitrarily, the present analysis explicitly takes into account individual perceptions about both the likelihood and the potential costs of job loss. We demonstrate that any model assessing the impact of perceived j...

2009
Stefan Jebens Rüdiger Weiner

In atmospheric models the highest-frequency modes are often not the physical modes of interest. On the other hand severe stability constrains for the numerical integrator arise from those meteorologically irrelevant modes. A common strategy to avoid this problem is a splitting approach: The differential equation is split into two parts. The slow part is integrated with one numerical method and ...

2014
Surbhi Agrawal

Job shop scheduling (JSS) is a problem which involves an assignment of a set of tasks to the machines in a predefined sequence in order to optimize one or more objectives considering job performance measures of the system. It’s a multi-objective, multi-criteria optimization problem. A job shop environment consists of ‘n’ jobs. Each job has a given machine routine in which some machines could be...

2008
Varun Gupta Jim Dai Mor Harchol-Balter Bert Zwart

The M/G/K queueing system is the oldest model for multi-server systems, and has been the topic of performance papers for almost half a century. However, even now, only coarse approximations exist for its mean waiting time. All the closed-form (non-numerical) approximations in the literature are based on the first two moments of the job size distribution. In this paper we prove that no approxima...

2007
M. Senthil Kumar R. Arumuganathan

⎯We consider a single server retrial queue with batch arrivals, two phases of heterogeneous service and multiple vacations with Npolicy. The primary arrivals find the server busy or doing secondary job (vacation) will join orbit (group of repeated calls). If the number of repeated calls in orbit is less than N, the server does the secondary job repeatedly until the retrial group size reaches N....

2008
John Ngubiri Mario van Vliet

Processor co-allocation can be of performance benefit. This is because breaking jobs into components reduces overall cluster fragmentation. However, the slower inter-cluster communication links increase job execution times. This leads to performance deterioration which can make co-allocation unviable. We use intra-cluster to inter-cluster communication speed ratio and job communication intensit...

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

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