15 search results - page 3 / 3 » A Fluid Heuristic for Minimizing Makespan in Job Shops |
ESWA
2010
13 years 3 months ago
2010
Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal solution (e.g., makespan), even though the actual requirement of most prod...
COR
2006
13 years 5 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
ANOR
2005
13 years 5 months ago
2005
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...
CCGRID
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract— Scientific computing is being increasingly deployed over volunteer-based distributed computing environments consisting of idle resources on donated user machines. A fu...
COR
2010
13 years 5 months ago
2010
This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and paralle...