Sciweavers

841 search results - page 8 / 169
» Job Scheduling in Rings
Sort
View
SCHEDULING
2010
104views more  SCHEDULING 2010»
14 years 5 months ago
A fluid approach to large volume job shop scheduling
We consider large volume job shop scheduling problems, in which there is a fixed number of machines, a bounded number of activities per job, and a large number of jobs. In large v...
Yoni Nazarathy, Gideon Weiss
115
Voted
EPS
1997
Springer
15 years 2 months ago
Investigating Parallel Genetic Algorithms on Job Shop Scheduling Problems
This paper describes a GA for job shop scheduling problems. Using the Giffler and Thompson algorithm, we created two new operators, THX crossover and mutation, which better trans...
Shyh-Chang Lin, Erik D. Goodman, William F. Punch ...
SIGECOM
2005
ACM
109views ECommerce» more  SIGECOM 2005»
15 years 3 months ago
Cost sharing in a job scheduling problem using the Shapley value
A set of jobs need to be served by a single server which can serve only one job at a time. Jobs have processing times and incur waiting costs (linear in their waiting time). The j...
Debasis Mishra, Bharath Rangarajan
SIGMETRICS
2002
ACM
110views Hardware» more  SIGMETRICS 2002»
14 years 9 months ago
Understanding the slowdown of large jobs in an M/GI/1 system
We explore the performance of an M/GI/1 queue under various scheduling policies from the perspective of a new metric: the it slowdown experienced by largest jobs. We consider sche...
Mor Harchol-Balter, Karl Sigman, Adam Wierman
83
Voted
RTCSA
2005
IEEE
15 years 3 months ago
Approximation Algorithms for Scheduling Multiple Feasible Interval Jobs
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...
Jian-Jia Chen, Jun Wu, Chi-Sheng Shih, Tei-Wei Kuo