31 search results - page 2 / 7 » A Randomized Algorithm for Flow Shop Scheduling |
INFORMATICASI
2008
13 years 5 months ago
2008
HM
2007
Springer
13 years 11 months ago
2007
Springer
This paper deals with the Permutation Flow Shop scheduling problem with the objective of minimizing total flow time, and therefore reducing in-process inventory. A new hybrid meta...
ICDCS
1992
IEEE
13 years 9 months ago
1992
IEEE
In a distributed system or communication network tasks may need to be executed on more than one processor. For time-critical tasks, the timing constraints are typically given as e...
MP
2002
13 years 5 months ago
2002
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
JAIR
2007
13 years 5 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...