Flowshop scheduling with limited temporary storage
Journal of the ACM (JACM)
Scheduling Algorithms
| Hi-index | 0.00 |
The purpose of this work is to investigate the classic two-machine permutation flow-shop scheduling with minimal makespan objective. The aim is characterizing a suitable policy for grid brokers when dealing with bag-of-task applications. This is a really complex goal as can be inferred by observing that even the simple scheduling of serial jobs on a single grid node represents a significant deal of research topics. This paper focuses on basic models of flow-shop scheduling process in order to identify a cost-function and determinate a class of solutions in the simple case referring to two machines with no intermediate buffer. Some specific solutions for heavy-constrained situations are also provided. These results will be the guidelines for grid scheduler implementing rules.