Job sequencing rules for minimizing the expected makespan in flexible machines
โ Scribed by Amiya K. Chakravarty; Nagraj Balakrishnan
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 863 KB
- Volume
- 96
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
โฆ Synopsis
We consider scheduling of a deteriorating flexible machine that is capable of processing a number of diverse jobs with negligible setup times between jobs. Specifically, we develop rules for sequencing N jobs on such a machine such that its expected makespan (sum of all job processing times and machine down-time) is minimized. Using the Weibull distribution to characterize machine failures in our model, we permit different jobs to contribute to machine deterioration (and hence its failure) at different failure rates, and do not require these rates to remain constant with machine-use time. We validate the effectiveness of these job sequencing rules for different cases, using extensive simulation tests.
๐ SIMILAR VOLUMES
A set P of n jobs has to be processed without preemption, one job at a time, on a single machine. The weight and processing time of each job is one. Furthermore, the jobs are subject to precedence constraints represented by a given ordered set (P, <). In a feasible schedule a job is called a tardy j