SCHEDULING BATCH PROCESSING MACHINES WITH INCOMPATIBLE JOB FAMILIES

被引：158

作者：

UZSOY, R

机构：

[1] School of Industrial Engineering, Purdue University, West Lafayette, IN, 47907-1287

来源：

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 1995年 / 33卷 / 10期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1080/00207549508904839

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

The problem of scheduling a single batch processing machine with incompatible job families was studied, where jobs of different families cannot be processed together in the same batch. First static problems where all jobs are available simultaneously were considered and showed that for a regular performance measure there will be no unnecessary partial batches. This allowed us to develop efficient optimal algorithms to minimize makespan (Cmax), maximum lateness (Lmax) and total weighted completion time and apply some of these results to problems with parallel identical batch processing machines. Then problems with dynamic job arrivals were considered and an efficient optimal algorithm for minimizing Cmax and several heuristics to minimize Lmax were provided. Computational experiments showed that the heuristics developed for the latter problem consistently improve on dispatching solutions in very reasonable CPU times.

引用

页码：2685 / 2708

页数：24

共 30 条

[1]

Ahmadi J.H., Ahmadi R.H., Dasu S., Tang C.S., Batching and scheduling jobs on batch and discrete processors, Operations Research, 40, pp. 750-763, (1992)

[2]

Baker K.R., Introduction to Sequencing and Scheduling, (1974)

[3]

Carlier J., The one-machine sequencing problem, European Journal of Operational Research, 11, pp. 42-47, (1982)

[4]

Chand S., Traub R., Uzsoy R., Single Machine Scheduling Problems with Dynamic Arrivals: Decomposition Results and a Forward Algorithm, (1993)

[5]

Chandra P., Gupta S., An Analysis of a Last-Station-Bottleneck Semiconductor Packaging Line, (1992)

[6]

Chandru V., Lee C.Y., Uzsoy R., Minimizing total completion time on batch processing machines, International Journal of Production Research, 31, pp. 2097-2121, (1993)

[7]

Chandru V., Lee C.Y., Uzsoy R., Minimizing total completion time on a batch processing machine with job families, Operations Research Letters, 13, pp. 61-65, (1993)

[8]

Deb R.K., Serfozo R.F., Optimal control of batch service queues, Advances in Applied Probability, 5, pp. 340-361, (1973)

[9]

Dobson G., Nabinadom R.S., The Batch Loading and Scheduling Problem, (1992)

[10]

Fowler J.W., Phillips D.T., Hogg G.L., Real-time control of multiproduct bulk-service semiconductor manufacturing processes, IEEE Transactions on Semiconductor Manufacturing, 5, pp. 158-163, (1992)

← 1 2 3 →