SciELO - Scientific Electronic Library Online

 
vol.21 número2Pareto optimal solutions for multi-objective generalized assignment problemDemand categorisation, forecasting, and inventory control for intermittent demand items índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Artigo

Indicadores

Links relacionados

  • Em processo de indexaçãoCitado por Google
  • Em processo de indexaçãoSimilares em Google

Compartilhar


South African Journal of Industrial Engineering

versão On-line ISSN 2224-7890
versão impressa ISSN 1012-277X

S. Afr. J. Ind. Eng. vol.21 no.2 Pretoria  2010

 

GENERAL ARTICLE

 

New heuristics for minimising total completion time and the number of tardy jobs criteria on a single machine with release time

 

 

E. O. OyetunjiI; A. E. OluleyeII

IDepartment of Computer Science, University for Development Studies, Ghana eoyetunii@vahoo.com
IIDepartment of Industrial and Production Engineering, University of Ibadan, Nigeria ayodeii.oluleye@mail.ui.edu.ng

 

 


ABSTRACT

This paper considers the bi-criteria scheduling problem of simultaneously minimising the total completion time and the number of tardy jobs with release dates on a single machine. Since the problem had been classified as Np-Hard, two heuristics (HR9 and HR10) were proposed for solving this problem. Performance evaluations of the proposed heuristics and selected solution methods (HR7 and BB) from the literature were carried out on 1,100 randomly generated problems ranging from 3 to 500 jobs. Experiment results show that HR7 outperformed HR10 when the number of jobs (n) is less than 30, while HR10 outperformed HR7 for n≥ 30.


OPSOMMING

In hierdie artikel word die bi-kriteria-skeduleringsprobleem bestudeer waar die totale voltooiingstyd en die aantal take wat laat is op 'n enkele masjien geminimiseer moet word. Verskeie heuristieke word voorgestel en getoets om sodoende die beste benadering te identifiseer.


 

 

“Full text available only in PDF format”

 

 

REFERENCES

[1] Abhyuday, D., Yung-Nein, Y., & Supphasak, P. 2003. On using intelligent scheduling for multi-criteria optimisation in a PC assembly model. In Proceedings of the 31st International Conference on Computers and Industrial Engineering, San Francisco, California, February, 2003.         [ Links ]

[2] Assayad, I., Girault, A., & Kalla, H. 2004. A bi-criteria scheduling heuristic for distributed embedded systems under reliability and real-time constraints. International Conference on Dependable Systems and Networks (DSN 2004), 28 Jun 1 July 2004, Florence, Italy, Proceedings. IEEE Computer Society 2004, pp. 347-356.         [ Links ]

[3] Benoit, A., Rehn-Sonigo, V., & Yves, R. 2007. Multi-criteria scheduling of pipeline workflows. In Proceedings of the 2007 IEEE International Conference on Cluster Computing, 17-20 September 2007, Austin, Texas, USA. IEEE 2007, pp. 515-524.         [ Links ]

[4] French, S. 1982. Sequencing and scheduling. Ellis Horwood Limited.         [ Links ]

[5] Geyik, F. 2002. A hybrid-framework for the multi-criteria production scheduling. In Proceedings of 2rd International Conference on Responsive Manufacturing (ICRM'2002), University of Gaziantep, Turkey, 26-28 June, pp. 782-788.         [ Links ]

[6] Hoogeveen, J.A. 2005. Multicriteria scheduling. European Journal of Operational Research, 167(3), pp. 592-623.         [ Links ]

[7] Johnson, S.M. 1954. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics, 1, pp. 61-68.         [ Links ]

[8] Peha, J.M. 1995. Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time. Journal of Computers and Operations Research, 22(10), pp. 1089-1100.         [ Links ]

[9] Landa, J.S. & Burke, E. 2004. A tutorial on multiobjective metaheuristics for scheduling and timetabling. In Multiple Objective MetaHeuristics (edited by X. Gandibleux, M. Sevaux, K. Sorensen and V. T'Kindt), Springer lecture notes in economics and mathematical systems, 2004.         [ Links ]

[10] Klusáček, D., Hana, R., Ranieri, B., Marco, P., & Gabriele, C. 2008. Comparison of multi-criteria scheduling techniques. In Thierry Priol, Sergei Gorlatch, Paraskevi Fragopoulou (eds), Grid computing achievements and prospects, pp. 173-184. Springer, 2008.         [ Links ]

[11] Leon, V.J. 2003. Multi-objective local search: Scheduling. Working paper, 2003.         [ Links ]

[12] Low, C., Yukling, Y., & Tai-His, W. 2006. Modelling and heuristics of FMS scheduling with multiple objectives. Computers & Operations Research, 33, pp. 674-694.         [ Links ]

[13] Nagar, A., Haddock J., & Heragu, S. 1995. Multiple and bicriteria scheduling: A literature survey. European Journal of Operational Research, 81(1), pp. 88-104.         [ Links ]

[14] Mehta, N.K., Jain, P.K., & Singh, A. 2006. Multi criteria selective rerouting in job shop by swapping of dispatching rules. SimTecT 2006 Simulation Conference: Challenges and Opportunities for a Complex and Networked World (SimTecT 2006), Melbourne, Australia, 29 May - 1 June, 2006.         [ Links ]

[15] Molnar, B. 2005. Multi-criteria scheduling of order picking processes with simulation optimisation. Periodica Polytechnica SER. TRANSP. ENG., 33(1-2), pp. 59-68.         [ Links ]

[16] Oyetunji, E.O. 2009a. Mixed multi-objectives scheduling problems. Paper presented at the 3rd Workshop on Mathematical and Computational Methods in Biology and Medicine (Holistic Modeling and Trends in the Biogeosciences) held at the University of Cape Coast, Cape Coast, Ghana, 21-24 May, 2009.         [ Links ]

[17] Oyetunji, E.O. 2009b. Truncation and composition of schedules: A good strategy for solving bicriteria scheduling problems. Paper presented at the International Conference on Mathematics and its Applications, University of Ghana, Legon, 16-19 June, 2009.         [ Links ]

[18] Oyetunji, E.O. & Oluleye, A.E. 2007. Heuristics for minimizing total completion time on single machine with release time. Advanced Materials Research, 18-19, pp. 347-352.         [ Links ]

[19] Oyetunji, E.O. & Oluleye, A.E. 2008a. Heuristics for minimizing total completion time and number of tardy jobs simultaneously on single machine with release time. Research Journal of Applied Sciences, 3(2), pp. 147-152.         [ Links ]

[20] Oyetunji, E.O. & Oluleye, A.E. 2008b. Hierarchical minimization of total completion time and number of tardy jobs criteria. Asian Journal of Information Technology, 7(4), pp. 157-161.         [ Links ]

[21] Oyetunji, E.O. & Oluleye, A.E. 2008c. Heuristics for minimizing number of tardy jobs on single machine with release time. South African Journal of Industrial Engineering, 19(2), pp. 183-196.         [ Links ]

[22] Oyetunji, E.O. & Oluleye, A.E. 2009. Evaluating solution methods to bicriteria scheduling problems. Advanced Materials Research, 62-64, pp. 577-584.         [ Links ]

[23] Stein, C. & Wein, J. 1997. On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Operations Research Letters, 21(3), pp. 115-122.         [ Links ]

[24] Petrovic, D., Alejandra, D., & Sania, P. 2007. Decision support tool for multi-objective job shop scheduling problems with linguistically quantified decision functions. Decision Support Systems, 43(4), pp. 1527-1538.         [ Links ]

[25] Yves, C. & Emmanuel, J. 2006. Multicriteria scheduling heuristics for GRIDRPC systems. The International Journal of High Performance Computing Applications, 20(1), pp. 61-76.         [ Links ]

[26] Van Veldhuizen, D. & Lamont, G. 2000. Multiobjective evolutionary algorithms: Analyzing the state-of-the-art. Evolutionary Computation, 8(2), pp. 125-147.         [ Links ]

[27] T'Kindt, V., Billaut, J.-C. & Proust, C. 2001. An interactive algorithm to solve bicriteria scheduling problems on unrelated parallel machines. European Journal of Operational Research, 135, pp. 42-49.         [ Links ]

[28] Nelson, R.T., Sarin, R.K. & Daniels, R.L. 1986. Scheduling with multiple performance measures: The one-machine case. Management Science, 32, pp. 464-479.         [ Links ]

[29] Hoogeveen, J.A. & van de Velde, S.L. 1995. Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Operations Research Letters, 17, pp. 205-208.         [ Links ]

[30] Verma, S. & Dessouky, M. 1998. Single-machine scheduling of unit-time jobs with earliness and tardiness penalties. Mathematics of Operations Research, 23, pp. 930-943.         [ Links ]

[31] Azizoglu, M., Kondakci, S. & Kdksalan, M. 2003. Single machine scheduling with maximum earliness and number tardy. Computers and Industrial Engineering, 45(2), pp. 257-268.         [ Links ]

[32] T'Kindt, V. & Billaut, J.-C. 2006. Multicriteria scheduling: Theory, models and algorithms. 2nd edition. Springer, Berlin.         [ Links ]

Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons