نتایج جستجو برای: job scheduling

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

H.R Dehnar Saidy M.T Taghavi-Fard

In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...

2009
Tony Wauters Yailen Martinez Patrick De Causmaecker Ann Nowé Katja Verbeeck

This paper addresses the application of AI techniques in a practical OR problem , i.e. scheduling. Scheduling is a scientific domain concerning the allocation of tasks to a limited set of resources over time. The goal of scheduling is to maximize (or minimize) different optimization criteria such as the makespan (i.e. the completion time of the last operation in the schedule), the occupation ra...

2000
K. Subramani

Scheduling in Real-time systems differs from scheduling in conventional models in two principal ways: (a) Parameter variability, (b) Existence of complex constraints between jobs. Our focus has been on variable execution times. Whereas traditional models assume fixed values for job execution time, we model execution times of jobs through convex sets. The second feature unique to real-time syste...

1997
Takeshi Yamada Ryohei Nakano

The n×m minimum-makespan general job-shop scheduling problem, hereafter referred to as the JSSP, can be described by a set of n jobs {Ji}1≤j≤n which is to be processed on a set of m machines {Mr}1≤r≤m. Each job has a technological sequence of machines to be processed. The processing of job Jj on machine Mr is called the operation Ojr. Operation Ojr requires the exclusive use of Mr for an uninte...

Journal: :Operations Research 1990

Journal: :Proceedings of International Conference on Leading Edge Manufacturing in 21st century : LEM21 2007

2012
P. Balasubramanie

Problem statement: The problem of scheduling n jobs on m machines with each job having specific machine route has been researched over the decade. The Job Shop Scheduling (JSS) is one of the hardest combinatorial optimization problems. Each resource can process at most one job at a time. Approach: This study proposes a new approach to solve a Job Shop Scheduling problem with the help of integra...

2017
Lipika Datta

A distributed system is a collection of independent computers that appears to its users as a single coherent system. Depending on job arrival rate some of the computing nodes may become overloaded while some other nodes may sit idle. The imbalance in load distribution may affect overall system performance. So proper task scheduling algorithm is needed. Real time task scheduling algorithm must t...

Journal: :Computing Systems 1989
Henry Massalin Calton Pu

We describe an implementation of a fine-grain adaptive scheduling mechanism, based on software feedback. Conventional scheduling makes job assignment exclusively a function of time. We broaden the meaning of the term "scheduling" to include job assignment as a function of a sequence of events, such as timer interrupts, I/O operations, queue overflodunderflow, and system call traps. Our implemen...

2008
Leyuan Shi Sigurdur Olafsson

We propose a new family of job scheduling policies for parallel computer systems that can be optimized to adapt to changes in the workload. Simulation optimization is used to reveal important properties of optimal job scheduling policies. For this optimization a new approach is suggested that combines two recent stochastic optimization methods: the nested partitions method and ordinal optimizat...

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

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