Skip to main content
SpringerLink
Log in

A Hybrid Electromagnetism-Like Algorithm for Single Machine Scheduling Problem

  • Conference paper
Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence (ICIC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4682))

Included in the following conference series:

Abstract

Electromagnetism-like algorithm (EM) is a population-based meta-heuristic which has been proposed to solve continuous problems effectively. In this paper, we present a new meta-heuristic that uses the EM methodology to solve the single machine scheduling problem. Single machine scheduling is a combinatorial optimization problem. Schedule representation for our problem is based on random keys. Because there is little research in solving the combinatorial optimization problem (COP) by EM, the paper attempts to employ the random-key concept enabling EM to solve COP in single machine scheduling problem. We present a hybrid algorithm that combines the EM methodology and genetic operators to obtain the best/optimal schedule for this single machine scheduling problem, which attempts to achieve convergence and diversity effect when they iteratively solve the problem. The objective in our problem is minimization of the sum of earliness and tardiness. This hybrid algorithm was tested on a set of standard test problems available in the literature. The computational results show that this hybrid algorithm performs better than the standard genetic algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdul-Razaq, T., Potts, C.N.: Dynamic Programming State-Space Relaxation for Single Machine Scheduling. Journal of the Operational Research Society 39, 141–152 (1988)

    Article  MATH  Google Scholar 

  2. Akturk, M.S., Ozdemir, D.: An Exact Approach to Minimize Total Weighted Tardiness with Release Date. IIE Tranactions 32, 1091–1101 (2000)

    Google Scholar 

  3. Akturk, M.S., Ozdemir, D.: A New Dominance Rule to Ninimize Total Weighted Tardiness with Unequal Release Dates. European Journal of Operational Research 135, 394–412 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Azizoglu, M., Kondakci, S., Omer, K.: Bicriteria Scheduling Problem Involving Total Tardiness and Total Earliness Penalties. International Journal of Production Economics 23, 17–24 (1991)

    Article  Google Scholar 

  5. Bauman, J., Józefowska, J.: Minimizing the Earliness-Tardiness Costs on a Single Machine. Computers & Operations Research 33(11), 3219–3230 (2006)

    Article  MATH  Google Scholar 

  6. Bean, J.C.: Genetic Algorithms and Random Keys for Sequencing and Optimization. ORSA Journal on Computing 6(2), 154–160 (1994)

    MATH  Google Scholar 

  7. Belouadah, H., Posner, M.E., Potts, C.N.: Scheduling with Release Dates on a Single Machine to Minimize Total Weighted Completion Time. Discrete Applied Mathematics 36, 213–231 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  8. Birbil, S.I., Fang, S.C.: An Electromagnetism-like Mechanism for Global Optimization. Journal of Global Optimization 25, 263–282 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Birbil, S.I., Fang, S.C., Sheu, R.L.: On the Convergence of a Population-Based Global Optimization Algorithm. Journal of Global Optimization 30, 301–318 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  10. Birbil, S.I., Feyzioglu, O.: A Global Optimization Method for Solving Fuzzy Relation Equations. In: De Baets, B., Kaynak, O., Bilgiç, T. (eds.) IFSA 2003. LNCS, vol. 2715, pp. 718–724. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Chang, P.C.: A Branch and Bound Approach for Single Machine Scheduling with Earliness and Tardiness Penalties. Computers and Mathematics with Applications 37, 133–144 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  12. Debels, D., Reyck, B.D., Leus, R., Vanhoucke, M.: A Hybrid Scatter Search/Electromagnetism Meta-Heuristic for Project Scheduling. European Journal of Operational Research 169, 638–653 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  13. Glover, F., Laguna, M., Marti, R.: Fundamentals of Scatter Search and Path Relinking. Control and Cybernetics 39, 653–684 (2000)

    MathSciNet  Google Scholar 

  14. Hariri, A.M.A., Potts, C.N.: Scheduling with Release Dates on a Single Machine to Minimize Total Weighted Completion Ttime. Discrete Applied Mathematics 36, 99–109 (1983)

    Article  Google Scholar 

  15. Kim, Y.D., Yano, C.A.: Minimizing Mean Tardiness and Earliness in Single-Machine Scheduling Problems with Unequal Due Dates. Naval Research logistics 41, 913–933 (1994)

    Article  MATH  Google Scholar 

  16. Lenstra, J.K., RinnooyKan, A.H.G., Brucker, P.: Complexity of Machine Scheduling Problems. Annals of Discrete Mathematics 1, 343–362 (1977)

    Article  MathSciNet  Google Scholar 

  17. Li, G.: Single Machine Earliness and Tardiness Scheduling. European Journal of Operational Research 96, 546–558 (1997)

    Article  MATH  Google Scholar 

  18. Liaw, C.F.: A Branch and Bound Algorithm for the Single Machine Earliness and Tardiness Scheduling Problem. Computers and Operations Research 26, 679–693 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  19. Mani, V., Chang, P.C., Chen, S.H.: Single Machine Scheduling: Genetic Algorithm with Dominance Properties. International Journal of Production Economics (2006) (Submitted to)

    Google Scholar 

  20. Norman, B.A., Bean, J.C.: A Genetic Algorithm Methodology for Complex Scheduling Problems. Naval Research Logistics 46(2), 199–211 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  21. Ow, P.S., Morton, E.T.: The Single Machine Early/Tardy Problem. Management Science 35, 171–191 (1989)

    Article  MathSciNet  Google Scholar 

  22. Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Prentice Hall, Upper Saddle River, NJ (2002)

    MATH  Google Scholar 

  23. Snyder, L.V., Daskin, M.S.: A Random-Key Genetic Algorithm for the Generalized Traveling Salesman Problem. European Journal of Operational Research 174(1), 38–53 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  24. Sourd, F., Sidhoum, S.K.: An Efficient Algorithm for the Earliness/Tardiness Scheduling Problem, Working paper - LIP6 (2005)

    Google Scholar 

  25. Su, L.H., Chang, P.C.: A Heuristic to Minimize a Quadratic Function of Job Lateness on a Single Machine. International Journal of Production Economics 55, 169–175 (1998)

    Article  Google Scholar 

  26. Su, L.H., Chang, P.C.: Scheduling n Jobs on One Machine to Minimize the Maximum Lateness with a Minimum Number of Tardy Jobs. Computers and Industrial engineering 40, 349–360 (2001)

    Article  Google Scholar 

  27. Tasgetiren, M.F., Sevkli, M., Liang, Y.C., Gencyilmaz, G.: Forthcoming, Particle Swarm Optimization Algorithm for Makespan and Total Flowtime Minimization in Permutation Flowshop Sequencing Problem. Accepted to the EJOR Special Issue on Evolutionary and Meta-Heuristic Scheduling by European Journal of Operational Research

    Google Scholar 

  28. Valente, J.M.S., Alves, R.A.F.S.: Heuristics for the Early/Tardy Scheduling Problem With Release Dates, Working paper, 129, Faculdade de Economia do porto, Portugal (2003)

    Google Scholar 

  29. Wu, P., Yang, K.J., Hung, Y.Y.: The Study of Electromagnetism-Like Mechanism Based Fuzzy Neural Network for Learning Fuzzy If-Then Rules. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds.) KES 2005. LNCS (LNAI), vol. 3684, pp. 382–388. Springer, Heidelberg (2005)

    Google Scholar 

  30. Wu, S.D., Dtorer, R.H., Chang, P.C.: One Machine Heuristic with Efficiency and Stability as Criteria. Computers and Operations Research 20, 1–14 (1993)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Management, Yuan Ze University,  

    Shih-Hsin Chen

  2. Department of Information Management, Yuan Ze University, 135 Yuan Tung Road, Ne-Li, Tao-Yuan, Taiwan, 32026, R.O.C.

    Pei-Chann Chang & Chien-Lung Chan

  3. Department of Aerospace Engineering, Indian Institute of Science, Bangalore, 560-012, India

    V. Mani

Authors
  1. Shih-Hsin Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pei-Chann Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chien-Lung Chan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. V. Mani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

De-Shuang Huang Laurent Heutte Marco Loog

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, SH., Chang, PC., Chan, CL., Mani, V. (2007). A Hybrid Electromagnetism-Like Algorithm for Single Machine Scheduling Problem. In: Huang, DS., Heutte, L., Loog, M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2007. Lecture Notes in Computer Science(), vol 4682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74205-0_59

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74205-0_59

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74201-2

  • Online ISBN: 978-3-540-74205-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation