{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T07:48:10Z","timestamp":1717055290966},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,12,6]],"date-time":"2008-12-06T00:00:00Z","timestamp":1228521600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s10479-008-0489-9","type":"journal-article","created":{"date-parts":[[2008,12,5]],"date-time":"2008-12-05T10:49:35Z","timestamp":1228474175000},"page":"197-211","source":"Crossref","is-referenced-by-count":19,"title":["Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems"],"prefix":"10.1007","volume":"180","author":[{"given":"Pei-Chann","family":"Chang","sequence":"first","affiliation":[]},{"given":"Shih-Hsin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Chin-Yuan","family":"Fan","sequence":"additional","affiliation":[]},{"given":"V.","family":"Mani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,12,6]]},"reference":[{"issue":"2","key":"489_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1057\/jors.1988.26","volume":"39","author":"T. Abdul-Razaq","year":"1988","unstructured":"Abdul-Razaq, T., & Potts, C. (1988). Dynamic programming state-space relaxation for single-machine scheduling. The Journal of the Operational Research Society, 39(2), 141\u2013152.","journal-title":"The Journal of the Operational Research Society"},{"key":"489_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1997-9","volume-title":"A connectionist machine for genetic hillclimbing","author":"D. H. Ackley","year":"1987","unstructured":"Ackley, D. H. (1987). A connectionist machine for genetic hillclimbing. Dordrecht: Kluwer Academic."},{"issue":"2","key":"489_CR3","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/S0377-2217(00)00319-2","volume":"135","author":"M. S. Akturk","year":"2001","unstructured":"Akturk, M. S., & Ozdemir, D. (2001). A new dominance rule to minimize total weighted tardiness with unequal release dates. European Journal of Operational Research, 135(2), 394\u2013412.","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"489_CR4","doi-asserted-by":"crossref","first-page":"3458","DOI":"10.1016\/j.cor.2006.02.008","volume":"34","author":"M. J. Alves","year":"2007","unstructured":"Alves, M. J., & Almeida, M. (2007). MOTGA: A multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem. Computers and Operations Research, 34(11), 3458\u20133470.","journal-title":"Computers and Operations Research"},{"key":"489_CR5","volume-title":"Introduction to sequencing and scheduling","author":"K. R. Baker","year":"1974","unstructured":"Baker, K. R. (1974). Introduction to sequencing and scheduling. New York: Wiley."},{"key":"489_CR6","unstructured":"Baluja, S. (1995). An empirical comparison of seven iterative and evolutionary function optimization heuristics."},{"key":"489_CR7","unstructured":"Baluja, S., & Davies, S. (1998). Fast probabilistic modeling for combinatorial optimization. In Proceedings of the fifteenth national\/tenth conference on artificial intelligence\/innovative applications of artificial intelligence table of contents (pp. 469\u2013476)."},{"issue":"6","key":"489_CR8","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1109\/4235.974843","volume":"5","author":"R. Baraglia","year":"2001","unstructured":"Baraglia, R., Hidalgo, J., Perego, R., NUCE I, & CNR P (2001). A hybrid heuristic for the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 5(6), 613\u2013622.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"3","key":"489_CR9","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0166-218X(92)90255-9","volume":"36","author":"H. Belouadah","year":"1992","unstructured":"Belouadah, H., Posner, M., & Potts, C. (1992). Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Applied Mathematics, 36(3), 213\u2013231.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"489_CR10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1022452626305","volume":"25","author":"\u015e. Birbil","year":"2003","unstructured":"Birbil, \u015e., & Fang, S. C. (2003). An electromagnetism-like mechanism for global optimization. Journal of Global Optimization, 25(3), 263\u2013282.","journal-title":"Journal of Global Optimization"},{"issue":"10","key":"489_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0898-1221(99)00130-3","volume":"37","author":"P. C. Chang","year":"1999","unstructured":"Chang, P. C. (1999). A branch and bound approach for single machine scheduling with earliness and tardiness penalties. Computers and Mathematics with Applications, 37(10), 133\u2013144.","journal-title":"Computers and Mathematics with Applications"},{"issue":"2","key":"489_CR12","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0360-8352(92)90039-M","volume":"22","author":"P. C. Chang","year":"1992","unstructured":"Chang, P. C., & Lee, H. C. (1992a). A greedy heuristic for bicriterion single machine scheduling problems. Computers and Industrial Engineering, 22(2), 121\u2013131.","journal-title":"Computers and Industrial Engineering"},{"issue":"6","key":"489_CR13","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1080\/02533839.1992.9677469","volume":"15","author":"P. C. Chang","year":"1992","unstructured":"Chang, P. C., & Lee, H. C. (1992b). A two phase approach for single machine scheduling: minimizing the total absolute deviation. Journal of the Chinese Institute of Engineers, 15(6), 735\u2013742.","journal-title":"Journal of the Chinese Institute of Engineers"},{"key":"489_CR14","unstructured":"Chang, P. C., Chen, S. H., & Fan, C. Y. (2008a). A novel electromagnetism-like algorithm in single machine scheduling problem with distinct due dates. Expert Systems with Applications 39(3)."},{"issue":"1","key":"489_CR15","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.asoc.2007.06.005","volume":"8","author":"P. C. Chang","year":"2008","unstructured":"Chang, P. C., Chen, S. H., & Fan, C. Y. (2008b). Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems. Applied Soft Computing Journal, 8(1), 767\u2013777.","journal-title":"Applied Soft Computing Journal"},{"issue":"1","key":"489_CR16","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/j.apm.2008.01.006","volume":"33","author":"P. C. Chang","year":"2009","unstructured":"Chang, P. C., Chen, S. H., & Mani, V. (2009). A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties. Applied Mathematical Modeling, 33(1), 579\u2013596.","journal-title":"Applied Mathematical Modeling"},{"key":"489_CR17","volume-title":"New ideas in optimization","author":"D. Corne","year":"1999","unstructured":"Corne, D., Dorigo, M., Glover, F., Dasgupta, D., Moscato, P., Poli, R., & Price, K. (1999). New ideas in optimization. New York: McGraw-Hill."},{"issue":"2","key":"489_CR18","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/4235.850651","volume":"4","author":"C. Dimopoulos","year":"2000","unstructured":"Dimopoulos, C., & Zalzala, A. (2000). Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons. IEEE Transactions on Evolutionary Computation, 4(2), 93\u2013113.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"12","key":"489_CR19","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1057\/palgrave.jors.2601784","volume":"55","author":"J. M. Framinan","year":"2004","unstructured":"Framinan, J. M., Gupta, J. N. D., & Leisten, R. (2004). A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society, 55(12), 1243\u20131255.","journal-title":"Journal of the Operational Research Society"},{"key":"489_CR20","volume-title":"Meta-heuristics: theory & applications","author":"F. Glover","year":"1996","unstructured":"Glover, F., & Kochenberger, G. (1996). Critical event tabu search for multidimensional knapsack problems. In Meta-heuristics: theory & applications. Dordrecht: Kluwer Academic."},{"key":"489_CR21","first-page":"61, 801","volume":"51","author":"G. Harik","year":"1999","unstructured":"Harik, G. (1999). Linkage learning via probabilistic modeling in the ECGA. Urbana, 51, 61, 801.","journal-title":"Urbana"},{"issue":"4","key":"489_CR22","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1109\/4235.797971","volume":"3","author":"G. Harik","year":"1999","unstructured":"Harik, G., Lobo, F., & Goldberg, D. (1999). The compact genetic algorithm. IEEE Transactions on Evolutionary Computation, 3(4), 287\u2013297.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"14","key":"489_CR23","doi-asserted-by":"crossref","first-page":"2895","DOI":"10.1080\/0020754050056417","volume":"43","author":"S. Hejazi","year":"2005","unstructured":"Hejazi, S., & Saghafian, S. (2005). Flowshop-scheduling problems with makespan criterion: a review. International Journal of Production Research, 43(14), 2895\u20132929.","journal-title":"International Journal of Production Research"},{"issue":"3","key":"489_CR24","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/j.ejor.2006.11.036","volume":"184","author":"A. Jouglet","year":"2008","unstructured":"Jouglet, A., Savourey, D., Carlier, J., & Baptiste, P. (2008). Dominance-based heuristics for one-machine total cost scheduling problems. European Journal of Operational Research, 184(3), 879\u2013899.","journal-title":"European Journal of Operational Research"},{"key":"489_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1539-5","volume-title":"Estimation of distribution algorithms: a new tool for evolutionary computation","author":"P. Larra\u00f1aga","year":"2002","unstructured":"Larra\u00f1aga, P., & Lozano, J. A. (2002). Estimation of distribution algorithms: a new tool for evolutionary computation. Dordrecht: Kluwer Academic."},{"key":"489_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1018909801944","volume":"70","author":"C. Y. Lee","year":"1997","unstructured":"Lee, C. Y., Lei, L., & Pinedo, M. (1997). Current trends in deterministic scheduling. Annals of Operations Research, 70, 1\u201341.","journal-title":"Annals of Operations Research"},{"key":"489_CR27","unstructured":"Lenstra, J., Kan, A., & Brucker, P. (1975). Complexity of machine scheduling problems. Stud. integer Program, Proc. Workshop Bonn."},{"issue":"3","key":"489_CR28","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/S0377-2217(96)00062-8","volume":"96","author":"G. Li","year":"1997","unstructured":"Li, G. (1997). Single machine earliness and tardiness scheduling. European Journal of Operational Research, 96(3), 546\u2013558.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"489_CR29","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1016\/S0305-0548(98)00081-1","volume":"26","author":"C. F. Liaw","year":"1999","unstructured":"Liaw, C. F. (1999). A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Computers and Operations Research, 26(7), 679\u2013693.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"489_CR30","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., & Kernighan, B. (1973). An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21(2), 498\u2013516.","journal-title":"Operations Research"},{"key":"489_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-32494-1","volume-title":"Towards a new evolutionary computation: advances in the estimation of distribution algorithms","author":"J. A. Lozano","year":"2006","unstructured":"Lozano, J. A. (2006). Towards a new evolutionary computation: advances in the estimation of distribution algorithms. Berlin: Springer."},{"issue":"4","key":"489_CR32","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1016\/0360-8352(96)00037-X","volume":"30","author":"Z. Michalewicz","year":"1996","unstructured":"Michalewicz, Z., Dasgupta, D., Le Riche, R., & Schoenauer, M. (1996). Evolutionary algorithms for constrained engineering problems. Computers & Industrial Engineering, 30(4), 851\u2013870.","journal-title":"Computers & Industrial Engineering"},{"key":"489_CR33","unstructured":"Montgomery, D. C. (2001). Design and analysis of experiments."},{"key":"489_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/3-540-61723-X_982","volume-title":"From recombination of genes to the estimation of distributions I. Binary parameters","author":"H. Muhlenbein","year":"1996","unstructured":"Muhlenbein, H., & Paa\u00df, G. (1996). From recombination of genes to the estimation of distributions I. Binary parameters. Lecture Notes in Computer Science (Vol. 1141, pp.\u00a0178\u2013187). Berlin: Springer."},{"issue":"4","key":"489_CR35","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1016\/0360-8352(96)00053-8","volume":"30","author":"T. Murata","year":"1996","unstructured":"Murata, T., Ishibuchi, H., & Tanaka, H. (1996). Genetic algorithms for flowshop scheduling problems. Computers & Industrial Engineering, 30(4), 1061\u20131071.","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"489_CR36","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/mnsc.35.2.177","volume":"35","author":"P. S. Ow","year":"1989","unstructured":"Ow, P. S., & Morton, T. E. (1989). The single machine early\/tardy problem. Management Science, 35(2), 177\u2013191.","journal-title":"Management Science"},{"key":"489_CR37","unstructured":"Pelikan, M., Goldberg, D. E., & Cantu-Paz, E. (1999). BOA: The Bayesian optimization algorithm. In Proceedings of the genetic and evolutionary computation conference GECCO-99 (Vol. 1, pp. 525\u2013532)."},{"issue":"1","key":"489_CR38","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1013500812258","volume":"21","author":"M. Pelikan","year":"2002","unstructured":"Pelikan, M., Goldberg, D. E., & Lobo, F. G. (2002). A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 21(1), 5\u201320.","journal-title":"Computational Optimization and Applications"},{"issue":"3","key":"489_CR39","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1162\/evco.2006.14.3.277","volume":"14","author":"R. Rastegar","year":"2006","unstructured":"Rastegar, R., & Hariri, A. (2006). A step forward in studying the compact genetic algorithm. Evolutionary Computation, 14(3), 277\u2013289.","journal-title":"Evolutionary Computation"},{"issue":"1","key":"489_CR40","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"C. R. Reeves","year":"1995","unstructured":"Reeves, C. R. (1995). A genetic algorithm for flowshop sequencing. Computers and Operations Research, 22(1), 5\u201313.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"489_CR41","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/j.ejor.2004.04.017","volume":"165","author":"R. Ruiz","year":"2005","unstructured":"Ruiz, R., & Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research, 165(2), 479\u2013494.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"489_CR42","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1177\/105971239700500203","volume":"5","author":"R. Schoonderwoerd","year":"1997","unstructured":"Schoonderwoerd, R., Holland, O. E., Bruten, J. L., & Rothkrantz, L. J. M. (1997). Ant-based load balancing in telecommunications networks. Adaptive Behavior, 5(2), 169.","journal-title":"Adaptive Behavior"},{"issue":"5","key":"489_CR43","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1109\/TSMCA.2003.817391","volume":"33","author":"K. M. Sim","year":"2003","unstructured":"Sim, K. M., & Sun, W. H. (2003). Ant colony optimization for routing and load-balancing: survey and new directions. IEEE Transactions on Systems, Man and Cybernetics, Part A, 33(5), 560\u2013572.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part A"},{"issue":"6","key":"489_CR44","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1023\/A:1026224610295","volume":"6","author":"F. Sourd","year":"2003","unstructured":"Sourd, F., & Kedad-Sidhoum, S. (2003). The one-machine problem with earliness and tardiness penalties. Journal of Scheduling, 6(6), 533\u2013549.","journal-title":"Journal of Scheduling"},{"key":"489_CR45","unstructured":"Sourd, F., & Kedad-Sidhoum, S. (2007). A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. Journal of Scheduling (pp. 1\u201310)."},{"issue":"8","key":"489_CR46","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. Stutzle","year":"2000","unstructured":"Stutzle, T., Hoos, H. H. et al. (2000). MAX-MIN ant system. Future Generation Computer Systems, 16(8), 889\u2013914.","journal-title":"Future Generation Computer Systems"},{"key":"489_CR47","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/B978-0-08-094832-4.50021-0","volume":"2","author":"G. Syswerda","year":"1993","unstructured":"Syswerda, G. (1993). Simulated crossover in genetic algorithms. Foundations of Genetic Algorithms, 2, 239\u2013255.","journal-title":"Foundations of Genetic Algorithms"},{"issue":"3","key":"489_CR48","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/j.cor.2003.08.003","volume":"32","author":"J. M. S. Valente","year":"2005","unstructured":"Valente, J. M. S., & Alves, R. A. F. S. (2005). Improved heuristics for the early\/tardy scheduling problem with no idle time. Computers and Operations Research, 32(3), 557\u2013569.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"489_CR49","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.ijpe.2006.06.006","volume":"106","author":"J. M. S. Valente","year":"2007","unstructured":"Valente, J. M. S., & Alves, R. A. F. S. (2007). Heuristics for the early\/tardy scheduling problem with release dates. International Journal of Production Economics, 106(1), 261\u2013274.","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"489_CR50","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0305-0548(93)90091-V","volume":"20","author":"S. D. Wu","year":"1993","unstructured":"Wu, S. D., Storer, R. H., & Chang, P. C. (1993). One-machine rescheduling heuristics with efficiency and stability as criteria. Computers and Operations Research, 20(1), 1\u201314.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"489_CR51","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1109\/TEVC.2003.820663","volume":"8","author":"Q. Zhang","year":"2004","unstructured":"Zhang, Q., & Muhlenbein, H. (2004). On the convergence of a class of estimation of distribution algorithms. IEEE Transactions on Evolutionary Computation, 8(2), 127\u2013136.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"489_CR52","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TEVC.2004.840835","volume":"9","author":"Q. Zhang","year":"2005","unstructured":"Zhang, Q., Sun, J., & Tsang, E. (2005). An evolutionary algorithm with guided mutation for the maximum clique problem. IEEE Transactions on Evolutionary Computation, 9(2), 192\u2013200.","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0489-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0489-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0489-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:52Z","timestamp":1559138872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0489-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,6]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["489"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0489-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,6]]}}}