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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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.
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.
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.
Chen, C.L. and R.L. Bulfin. (1993). “Complexity of Single Machine, Multi-Criteria Scheduling Problems. ” European Journal of Operational Research 70, 115–125.
Chu, C. (1992). “A Branch and Bound Algorithm to Minimize Total Flow Time with Unequal Release Dates. ” Naval Research Logistics 39, 859–875.
Connoly, D.T. (1990). “An Improved Annealing Scheme for the QAP. ” European Journal of Operational Research 46, 93–100.
Deogun, J.S. (1983). “On Scheduling with Ready Times to Minimize Mean Flow Time. ” The Computer Journal 26(4), 320–328.
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.
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.
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.
Kiran, A.S. and A.T. Unal. (1991). “A Single-Machine Problem with Multiple Criteria. ” Naval Research Logistics 38(5), 721–727.
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.
Kondakci, S. and T. Bekiroglu. (1997). “Scheduling with Bicriteria: Total Flowtime and Number of Tardy Jobs. ” International Journal of Production Economics 54, 91–99.
Koksalan, M., M. Azizoglu, and S. Kondakci. (1998). “Minimizing Flowtime and Maximum Earliness on a Single Machine. ” IIE Transactions 30, 192–200.
Koulamas, C. (1997). “Decomposition and Hybrid Simulated Annealing Heuristics for the Parallel-Machine Total Tardiness Problem. ” Naval Research Logistics 44, 109–125.
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.
Lenstra, J.K., A.H.G. Rinnooy Kan, and P. Brucker. (1977). “Complexity of Machine Scheduling Problems. ” Annals of Discrete Mathematics 1, 343–362.
Lin, K.S. (1983). “Hybrid Algorithm for Sequencing with Bicriteria. ” Journal of Optimization Theory and Applications 39, 105–124.
Lin, S. and B.W. Kernighan. (1973). “An Effective Heuristic Algorithm for the Traveling Salesman Problem. ” Operations Research 21, 498–516.
Lundy, M. and A. Mees. (1986). “Convergence of an Annealing Algorithm. ” Mathematical Programming 34, 111–124.
Moore, J.M. (1968). “A n-Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs. ” Management Science 15(1), 102–109.
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.
Potts, C.N. and L.N. Van Wassenhove. (1991). “Single MachineTardiness Sequencing Heuristics. ” IIE Transactions 23(4), 346–354.
Sen, T. and S.K. Gupta. (1983). “A Branch and Bound Procedure to Solve a Bicriterion Scheduling Problem. ” IIE Transactions 15, 84–88.
Steuer, R.E. (1986). Multiple Criteria Optimization: Theory, Computation and Application. New York: Wiley.
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.
Van Wassenhove, L.N. and F. Gelders. (1980). “Solving a Bicriterion Scheduling Problem. ” European Journal of Operational Research 4, 42–48.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Karasakal, E.K., Köksalan, M. A Simulated Annealing Approach to Bicriteria Scheduling Problems on a Single Machine. Journal of Heuristics 6, 311–327 (2000). https://doi.org/10.1023/A:1009622230725
Issue Date:
DOI: https://doi.org/10.1023/A:1009622230725