Impact Assessment of Job Machine Factors on Scaling Parameters

Abstract:

Composite dispatching rules are of great importance in solving realistic scheduling problems because they are fast and easy to implement. The successful implementation of composite dispatching rules depends on their scaling parameter values, while further the appropriate scaling parameter values are determined by specific problem instance features, i.e. job machine factors. In this paper, a Face-centered Cube experimental design is proposed to study the impact of job machine factors on scaling parameter values when Apparent Tardiness Cost with Setups (ATCS) rule is used to schedule Pm|s_jk|Σw_jT_j problem. The dynamics between the job machine factors and the good scaling parameter values are revealed by experimental results.

• Periodical: Advanced Materials Research (Volume 340)
• Pages: 23-29
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.340.23
• Online since: September 2011
• Authors: Yan Chen
• Keywords: Apparent Tardiness Cost with Setups (ATCS) Rule, Composite Dispatching Rules, Experimental Design, Face-Centered Cube Experimental Design

References

[1] M.L. Pinedo. Scheduling: Theory, Algorithms and Systems. 2nd Edition. New Jersey: Prentice-Hall, Inc. (2002).

[2] M.L. Pinedo. Planning and Scheduling in Manufacturing and Services. 1st Edition. Springer-Verlag: New York. (2005).

[3] K.R. Baker and J.W. Bertrand. A dynamic priority rule for sequencing against due dates. Journal of Operations Management, 3, 37-42. (1982).

DOI: 10.1016/0272-6963(82)90020-1

[4] K.R. Baker and J.W. Bertrand. A dynamic priority rule for sequencing against due dates. Journal of Operations Management, 3, 37-42. (1982).

DOI: 10.1016/0272-6963(82)90020-1

[5] Y. Chen, M.E. Pfund, J.W. Fowler, D.C. Montgomery and T.E. Callarman. Robust scaling parameters for composite dispatching rules. IIE Transactions, 42, 842-853. (2010).

DOI: 10.1080/07408171003685825

[6] S.Y. Kim, Y.H. Lee and D. Agnihotri. A Hybrid approach to sequencing jobs using heuristic rules and neural network. Production Planning and Control, 6(5), 445-454. (1995).

DOI: 10.1080/09537289508930302

[7] Y.H. Lee, K. Bhaskaran and M. Pinedo. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions, 29, 45-52. (1997).

DOI: 10.1080/07408179708966311

[8] Y.H. Lee and M. Pinedo. Scheduling jobs on parallel machines with sequence dependent setup times. European Journal of Operational Research, 100, 464-474. (1997).

DOI: 10.1016/s0377-2217(95)00376-2

[9] T. Morton and D. Pentico. Heuristic Scheduling Systems: with Applications to Production Systems and Project Management. New York: John Wiley and Sons. (1993).

[10] Y. Park, S. Kim, and Y.H. Lee. Scheduling jobs on parallel machines applying neural network and heuristic rules. Computers and Industrial Engineering, 38, 189-202. (2000).

DOI: 10.1016/s0360-8352(00)00038-3

[11] M.E. Pfund, J.W. Fowler, A. Gadkari, and Y. Chen. Scheduling Jobs on Parallel Machines with Setup Times and Ready Times, Computers and Industrial Engineering, 54(4), 764-782. (2008).

DOI: 10.1016/j.cie.2007.08.011

[12] R.V. Rachamadugu and T.E. Morton. Myopic heuristics for the single machine weighted tardiness problem. Working Paper, 30-82-83, GSIA. Pittsburgh, PA: Carnegie Mellon University. (1982).

[13] A. Vepsalainen and T. Morton. Priority rules for job shops with weighted tardiness costs. Management Science, 33, 1035-1047. (1987).

DOI: 10.1287/mnsc.33.8.1035

[14] E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan. Recent developments in Deterministic Sequencing and Scheduling: A Survey. Deterministic and Stochastic Scheduling, Dempster, Lenstra and Rinnooy Kan (eds), 35-74. (1982).

DOI: 10.1007/978-94-009-7801-0_3

[15] Montgomery, D.C. Design and Analysis of Experiments. 7th Edition. John Wiley and Sons: New York. (2009).

[16] Stat-Ease, Inc. Design-Expert Version 6. 0. 0, USA: Stat-Ease, Inc. (2000).