Advertisement

Journal of Heuristics

, Volume 6, Issue 3, pp 311–327 | Cite as

A Simulated Annealing Approach to Bicriteria Scheduling Problems on a Single Machine

  • Esra Köktener Karasakal
  • Murat Köksalan
Article

Abstract

In this paper, we apply a simulated annealing approach to two bicriteria scheduling problems on a single machine. The first problem is the strongly NP-hard problem of minimizing total flowtime and maximum earliness. The second one is the NP-hard problem of minimizing total flowtime and number of tardy jobs. We experiment on different neighbourhood structures as well as other parameters of the simulated annealing approach to improve its performance. Our computational experiments show that the developed approach yields solutions that are very close to lower bounds and hence very close to the optimal solutions of their corresponding problems for the minimization of total flowtime and maximum earliness. For the minimization of total flowtime and number tardy, our experiments show that the simulated annealing approach yields results that are superior to randomly generated schedules.

simulated annealing heuristics single machine scheduling bicriteria scheduling flowtime maximum earliness number of tardy jobs 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Belouadah, H., M.E. Posner, and C.N. Potts. (1992). “Scheduling with Release Dates on a Single Machine to Minimize Total Weighted Completion Time. ” Discrete Applied Mathematics 36, 213–231.Google Scholar
  2. Ben-Daya, M. and M. Al-Fawzan. (1996). “A Simulated Annealing Approach for the One-Machine Mean Tardiness Scheduling Problem. ” European Journal of Operational Research 93, 61–67.Google Scholar
  3. Bianco, L. and S. Ricciardelli. (1982). “Scheduling of a Single Machine to Minimize Total Weighted Completion Time Subject to Release Dates. ” Naval Research Logistics Quarterly 29, 151–167.Google Scholar
  4. Chen, C.L. and R.L. Bulfin. (1993). “Complexity of Single Machine, Multi-Criteria Scheduling Problems. ” European Journal of Operational Research 70, 115–125.Google Scholar
  5. Chu, C. (1992). “A Branch and Bound Algorithm to Minimize Total Flow Time with Unequal Release Dates. ” Naval Research Logistics 39, 859–875.Google Scholar
  6. Connoly, D.T. (1990). “An Improved Annealing Scheme for the QAP. ” European Journal of Operational Research 46, 93–100.Google Scholar
  7. Deogun, J.S. (1983). “On Scheduling with Ready Times to Minimize Mean Flow Time. ” The Computer Journal 26(4), 320–328.Google Scholar
  8. Dessouky, M.I. and J.S. Deogun. (1981). “Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time. ” SIAM Journal on Computing 10(1), 192–202.Google Scholar
  9. Dyer, M.E. and L.A. Wolsey. (1990). “Formulating the Single Machine Sequencing Problem with Release Dates as a Mixed Integer Program. ” Discrete Applied Mathematics 26, 255–270.Google Scholar
  10. Heck, H. and S. Roberts. (1972). “A Note on the Extension of a Result on Scheduling with Secondary Criteria. ” Naval Research Logistics Quarterly 19, 403–405.Google Scholar
  11. Kiran, A.S. and A.T. Unal. (1991). “A Single-Machine Problem with Multiple Criteria. ” Naval Research Logistics 38(5), 721–727.Google Scholar
  12. Kondakci, S., M. Azizoglu, and M. Koksalan. (1994). “Generating Efficient Schedules for Flowtime and Maximum Tardiness Measures. ” In GWO-Hshiung Tzeng, Ue-Pyng Wen, and Po-Lung Yu (eds.), Multiple Criteria Decision Making: Expand and Enrich the Domains of Thinking and Application. Verlag: Springer.Google Scholar
  13. Kondakci, S. and T. Bekiroglu. (1997). “Scheduling with Bicriteria: Total Flowtime and Number of Tardy Jobs. ” International Journal of Production Economics 54, 91–99.Google Scholar
  14. Koksalan, M., M. Azizoglu, and S. Kondakci. (1998). “Minimizing Flowtime and Maximum Earliness on a Single Machine. ” IIE Transactions 30, 192–200.Google Scholar
  15. Koulamas, C. (1997). “Decomposition and Hybrid Simulated Annealing Heuristics for the Parallel-Machine Total Tardiness Problem. ” Naval Research Logistics 44, 109–125.Google Scholar
  16. Krishna, K., K. Ganeshan, and D. Janaki Ram. (1995). “Distributed Simulated Annealing Algorithms for Job Shop Scheduling. ” IEEE Transactions on Systems, Man and Cybernetics 25(7), 1102–1109.Google Scholar
  17. Lenstra, J.K., A.H.G. Rinnooy Kan, and P. Brucker. (1977). “Complexity of Machine Scheduling Problems. ” Annals of Discrete Mathematics 1, 343–362.Google Scholar
  18. Lin, K.S. (1983). “Hybrid Algorithm for Sequencing with Bicriteria. ” Journal of Optimization Theory and Applications 39, 105–124.Google Scholar
  19. Lin, S. and B.W. Kernighan. (1973). “An Effective Heuristic Algorithm for the Traveling Salesman Problem. ” Operations Research 21, 498–516.Google Scholar
  20. Lundy, M. and A. Mees. (1986). “Convergence of an Annealing Algorithm. ” Mathematical Programming 34, 111–124.Google Scholar
  21. Moore, J.M. (1968). “A n-Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs. ” Management Science 15(1), 102–109.Google Scholar
  22. Nelson, R.T., R.K. Sarin, and R.L. Daniels. (1986). “Scheduling with Multiple Performance Measures: The One Machine Case. ” Management Science 32, 464–479.Google Scholar
  23. Potts, C.N. and L.N. Van Wassenhove. (1991). “Single MachineTardiness Sequencing Heuristics. ” IIE Transactions 23(4), 346–354.Google Scholar
  24. Sen, T. and S.K. Gupta. (1983). “A Branch and Bound Procedure to Solve a Bicriterion Scheduling Problem. ” IIE Transactions 15, 84–88.Google Scholar
  25. Steuer, R.E. (1986). Multiple Criteria Optimization: Theory, Computation and Application. New York: Wiley.Google Scholar
  26. Tan, K.C. and R. Narasimhan. (1997). “Minimizing Tardiness on a Single Processor with Sequence-Dependent Setup Times: A Simulated Annealing Approach. ” Omega 25(6), 619–634.Google Scholar
  27. Van Wassenhove, L.N. and F. Gelders. (1980). “Solving a Bicriterion Scheduling Problem. ” European Journal of Operational Research 4, 42–48.Google Scholar

Copyright information

© Kluwer Academic Publishers 2000

Authors and Affiliations

  • Esra Köktener Karasakal
    • 1
  • Murat Köksalan
    • 2
  1. 1.Department of Industrial EngineeringMiddle East Technical UniversityAnkaraTurkey
  2. 2.Department of Industrial EngineeringMiddle East Technical UniversityAnkaraTurkey

Personalised recommendations