Browse > Article

Uniform Parallel Machine Scheduling  

Kim, Dae-Cheol (School of Business, Hanyang University)
Publication Information
Journal of Korean Society of Industrial and Systems Engineering / v.29, no.2, 2006 , pp. 7-12 More about this Journal
Abstract
This study considers the problem of scheduling jobs on uniform parallel machines with a common due date. The objective is to minimize the total absolute deviation of job completion times about the common due date. This problem is motivated by the fact that a certain phase of printed circuit board manufacturing is bottleneck and the processing speeds of parallel machines in this phase are uniformly different for all jobs. Optimal properties are proved and a simple polynomial time optimal algorithm is developed.
Keywords
bottleneck; uniform parallel machine; scheduling; common due date; PCB;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Baker, K. R. and Scudder, G. D., 'Sequencing with Earliness and Tardiness Penalties: A Review,' Operations Research, 38 : 22-36, 1990   DOI   ScienceOn
2 Sundararaghavan, P. and Ahmed, M., 'Minimizing the Sum of Lateness in Single-Machine and Multimachine Scheduling,' Naval Res. Logist. Quart., 31 : 325-333, 1984   DOI
3 Ventura, J. and Kim, D., 'Parallel machine scheduling with earliness-tardiness penalties and additional resource constraints,' Computers & OR, 30 : 1945-1958, 2003   DOI   ScienceOn
4 Yu, L., Smith, H. M., Pfund, M., Carlyle, W. M., and Fowler, J. W., 'Scheduling of unrelated parallel machines: an application to PWB manufacturing,' IIE Transactions, 34 : 921-931, 2002
5 Kanet, J. J., 'Minimizing the Average Deviation of Job Completion Times about a Common Due Date,' Naval Research Logistics Quarterly, 28 : 643-651, 1981   DOI
6 Hall, N. G., 'Single- and Multi-Processor Models for Minimizing Completion Time Variance,' Naval Res. Logist. Quart., 33 : 49-54, 1986   DOI
7 Palekar, U. S., Rama, N., and Toaffe, K., 'Duality based relaxations for makespan minimization for unrelated parallel machines,' TIMS/ORSA Bulletin, 31 (MC2.2) : 21, 1991
8 Martello, S., Soumis, F., and Toth, P., 'Exact and approximation algorithms for makespan minimization on unrelated parallel machines,' Discrete Applied Mathematics, 75 : 169-188, 1977   DOI   ScienceOn
9 Baker, K. R., Introduction to Sequencing and Scheduling, N.Y., John Wiley, 1974
10 Cheng, T. C. E. and Sin, C. C. S., 'A state-of-the-art review of parallel-machine scheduling research,' European Journal of Operational Research, 47 : 271-292, 1990   DOI   ScienceOn
11 Ventura, J. and Kim, D., 'Parallel Machine Scheduling about an Unrestricted Due Date and Resource Constraints,' IIE Transactions, 32(2) : 147-153, 2000
12 Piersma, N. and Van Dijk, W., 'A local search heuristics for unrelated parallel machine scheduling with efficient neighborhood search,' Mathematical Computer Modelling, 24(9) : 11-19, 1996
13 Pinedo, M. and Pinedo, M., Scheduling: Theory, Algorithm, and Systems, Englewood Cliffs, N.J., Prentice Hall, 1995