841 search results - page 108 / 169 » Job Scheduling in Rings |
COR
2010
13 years 11 months ago
2010
This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search met...
JSSPP
1995
Springer
14 years 2 months ago
1995
Springer
During the past ve years scientists discovered that modern UNIX workstations connected with ethernet and ber networks could provide enough computational performance to compete wit...
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
CEC
2007
IEEE
14 years 5 months ago
2007
IEEE
— Many scheduling algorithms search the space of possible solutions (schedules), but some instead search the space of permutations of the set of jobs, employing a greedy algorith...
IEAAIE
2005
Springer
14 years 4 months ago
2005
Springer
When using a constructive search algorithm, solutions to scheduling problems such as the job shop and open shop scheduling problems are typically represented as permutations of the...