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 volume job shops it makes sense to solve a fluid problem and to schedule the jobs in such a way as to track the fluid solution. There have been several papers which used this idea to propose approximate solutions which are asymptotically optimal as the volume increases. We survey some of these results here. In most of these papers it is assumed that the problem consists of many identical copies of a fixed set of jobs. Our contribution in this paper is to extend the results to the far more general situation in which the many jobs are all different. We propose a very simple heuristic which can schedule such problems. We discuss asymptotic optimality of this heuristic, under a wide range of previously unexplored situations. We provide a software package to explore the performance of our policy, and present extensive computational evidence for its effectiveness.
|Number of pages||21|
|Journal||Journal of Scheduling|
|State||Published - Oct 2010|
Bibliographical noteFunding Information:
Research supported in part by Israel Science Foundation Grant 249/02 and 454/05 and by European Network of Excellence Euro-NGI. Part of this research was conducted while Yoni Nazarathy was a student at the University of Haifa.
- Fluid approximation
- Fluid tracking policy
- Job shops
- Stochastic scheduling
ASJC Scopus subject areas
- Engineering (all)
- Management Science and Operations Research
- Artificial Intelligence