Abstract
Single machine scheduling problems with release time are the prototypes for other complicated scheduling systems. Genetic local search algorithms are proposed to minimize total weighted completion time. Numerical experiments to evaluate the three embedding local search techniques are done. The results indicate that the 2r i+t i rule proposed by Liu and MacCathy (1991) outperform ERT and WSPT.
Chapter PDF
Similar content being viewed by others
6. References
Baker, K., (1974), Introduction to Sequencing and Scheduling, New York: Wiley.
Chand, S., Traub, R., Uzsoy, R., (1996a), An iterative heuristic for the single machine dynamic total completion time scheduling problem, Computers and Operations Research, Vol. 23, pp.641–651.
Chand, S., Traub, R., Uzsoy, R., (1996b), Single-machine scheduling with dynamic arrivals: decomposition results and an improved algorithm, Naval Research Logistics, Vol. 43, pp.709–719.
Chang, P.C., Chung, Y.K., Hsieh, J.C., (2004), On single-machine scheduling with release times to minimize total weighted completion time, Journal of the Chinese Institute of Industrial Engineers, Vol. 21, pp. 567–575.
Chu, C, (1992), A branch-and-bound algorithm to minimize total flow time with unequal release dates, Naval Research Logistics, Vol. i39, pp.859–875.
Deogun, J.S., (1983), On scheduling with ready times to minimize mean flow time, Computer Journal, Vol. 26, pp.320–328.
Dessouky, M.I., Deogun, J.S., (1981), Sequencing jobs with unequal ready times to minimize mean flow time, SIAM Journal of Computing, Vol. 10, pp. 192–202.
Goldberg, D.E., (1989), Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Publishing Company, Inc.
Hariri, A.M.A., Potts, C.N., (1983), An algorithm for single machine sequencing with release dates to minimize total weighted completion time, Discrete Applied Mathematics, Vol. 5, pp.99–109.
Liu, J., MacCarthy, B.L., (1991), Effective heuristics for single machine sequencing problem with ready times, International Journal of Production Research, Vol. 29, pp.1521–1533.
Liu, J., Tang, L. (1999), A modified genetic algorithm for single machine scheduling, Computers and Industrial Engineering, Vol. 37, pp.43–46.
Madureira, A., Ramos, C, do Carmo Silva, S., (2001), A GA based scheduling system for dynamic single machine problem, Proceedings of the 4 th IEEE International Symposium on Assembly and Task Planning, Soft Research Park, Fukuoka, Japan, May 28–29, pp.262–267.
Reeves, C, (1995), Heuristics for scheduling a single machine subject to unequal job release times, European Journal of Operational Research, Vol. 80, pp.397–403.
Rinnooy Kan, A.H.G., (1976), Machine Scheduling Problem: Classification, Complexity, and Computations, The Hague: Martinus Nijhoff.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Hsieh, J., Chang, P., Chen, S. (2006). Genetic Local Search Algorithms for Single Machine Scheduling Problems with Release Time. In: Wang, K., Kovacs, G.L., Wozny, M., Fang, M. (eds) Knowledge Enterprise: Intelligent Strategies in Product Design, Manufacturing, and Management. PROLAMAT 2006. IFIP International Federation for Information Processing, vol 207. Springer, Boston, MA . https://doi.org/10.1007/0-387-34403-9_122
Download citation
DOI: https://doi.org/10.1007/0-387-34403-9_122
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34402-7
Online ISBN: 978-0-387-34403-4
eBook Packages: Computer ScienceComputer Science (R0)