{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:25:03Z","timestamp":1738387503485,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540789840"},{"type":"electronic","value":"9783540789857"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-78985-7_4","type":"book-chapter","created":{"date-parts":[[2008,8,21]],"date-time":"2008-08-21T08:24:18Z","timestamp":1219307058000},"page":"91-103","source":"Crossref","is-referenced-by-count":2,"title":["A Dynamical Ant Colony Optimization with Heuristics for Scheduling Jobs on a Single Machine with a Common Due Date"],"prefix":"10.1007","author":[{"given":"Zne-Jung","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shih-Wei","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuo-Ching","family":"Ying","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"4_CR1_1","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1016\/S0305-0548(00)00008-3","volume":"28","author":"D Biskup","year":"2001","unstructured":"Biskup, D. and Feldmann, M. (2001) Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates, Computers and Operations Research: 28(8) 787-801.","journal-title":"Computers and Operations Research"},{"key":"4_CR2_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M. and Johnson, D. (1979). Computers and Intractability: A Guide to the Theory of NP Completeness, W. H. Freeman and Company, San Francisco, California."},{"key":"4_CR3_1","unstructured":"Bose, R. (2002) Information theory, coding, and cryptography, McGraw Hill."},{"issue":"1","key":"4_CR4_1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"139","author":"V Gordon","year":"2002","unstructured":"Gordon, V., Proth, J.-M. and Chu, C. (2002) A survey of the state-of-art of common due date assignment and scheduling research, European Journal of Operational Research: 139(1) 1-25.","journal-title":"European Journal of Operational Research"},{"key":"4_CR5_1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1023\/B:JMMA.0000036573.01968.1b","volume":"3","author":"JND Gupta","year":"2004","unstructured":"Gupta, J. N. D., Lauff, V. and Wernerm F. (2004) Two-machine flow shop problems with nonregular criteria, Journal of Mathematical Modelling and Algorithms: 3 123-151.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"issue":"2","key":"4_CR6_1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/S0360-8352(02)00181-X","volume":"44","author":"M Feldmann","year":"2003","unstructured":"Feldmann, M. and Biskup D. (2003) Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches, Computers and Industrial Engineering: 44(2) 307-323.","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"4_CR7_1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0305-0548(96)00052-4","volume":"24","author":"RJW James","year":"1997","unstructured":"James, R. J. W. (1997) Using tabu search to solve the common due date early\/tardy machine scheduling problem, Computers and Operations Research: 24(3) 199-208.","journal-title":"Computers and Operations Research"},{"issue":"5","key":"4_CR8_1","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1287\/opre.39.5.847","volume":"39","author":"NG Hall","year":"1991","unstructured":"Hall, N. G., Kubiak, W. and Sethi, S. P. (1991) Earliness-tardiness scheduling problem, II: deviation of completion times about a restrictive common due date, Operations Research: 39(5) 847-856.","journal-title":"Operations Research"},{"issue":"1","key":"4_CR9_1","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.ejor.2004.03.006","volume":"160","author":"CM Hino","year":"2005","unstructured":"Hino, C. M., Ronconi, D. P., and Mendes, A. B. (2005) Minimizing earliness and tardiness penalties in a single-machine problem with a common due date, European Journal of Operational Research: 160(1) 190-201.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"4_CR10_1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0377-2217(91)90228-N","volume":"55","author":"JA Hoogeveen","year":"1991","unstructured":"Hoogeveen, J. A. and Velde Van De S. L. (1991) Scheduling around a small common due date, European Journal and Operational Research: 55(2) 237-242.","journal-title":"European Journal and Operational Research"},{"key":"4_CR11_1","doi-asserted-by":"publisher","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 679-693.","journal-title":"Computers and Operations Research"},{"key":"4_CR12_1","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/S0305-0548(99)00153-7","volume":"28","author":"SA Mondal","year":"2001","unstructured":"Mondal, S. A. and Sen, A. K. (2001) Single machine weighted earliness\u2013tardiness penalty problem with a common due date, Computers and Operations Research: 28 649-669.","journal-title":"Computers and Operations Research"},{"key":"4_CR13_1","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1016\/j.ejor.2005.11.015","volume":"177","author":"S-W Lin","year":"2007","unstructured":"Lin, S.-W., Chou, S.-Y., and Ying, K.-C. (2007) A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date, European Journal of Operational Search: 177 1294-1301.","journal-title":"European Journal of Operational Search"},{"key":"4_CR14_1","volume-title":"Resource Allocation Problems","author":"T Ibarraki","year":"1988","unstructured":"Ibarraki T. and Katoh N. (1988) Resource Allocation Problems: The MIT Press: Cambridge, Massachusetts."},{"key":"4_CR15_1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.ins.2004.07.010","volume":"173","author":"Z-J Lee","year":"2005","unstructured":"Lee, Z.-J., Lee, C.-Y. (2005) A Hybrid Search Algorithm with Heuristics for Resource Allocation Problem, Information sciences: 173 155-167.","journal-title":"Information sciences"},{"key":"4_CR16_1","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0305-0548(93)90066-R","volume":"20","author":"J Mittenthal","year":"1993","unstructured":"Mittenthal, J., M. Raghavachari, and A. I. Rana. (1993) A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions, Computers and Operations Research: 20 103-111.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"4_CR17_1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0360-8352(94)00197-U","volume":"28","author":"CY Lee","year":"1995","unstructured":"Lee, C. Y. and Kim, S. J. (1995) Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights, Computers and Industrial Engineering: 28(2) 231-243.","journal-title":"Computers and Industrial Engineering"},{"key":"4_CR18_1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.rcim.2004.12.005","volume":"22","author":"M Liu","year":"2006","unstructured":"Liu, M. and Wu, M. (2006) Genetic algorithm for the optimal common due date assignment and the optimal policy in parallel machine earliness\/tardiness scheduling problems, Robotics and Computer-Integrated Manufacturing: 22 279-287.","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"issue":"9","key":"4_CR19_1","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1109\/PROC.1982.12425","volume":"70","author":"ET Jaynes","year":"1982","unstructured":"Jaynes, E. T. (1982) On the rationale of the maximum entropy methods. Proceedings of the IEEE: 70(9) 939-952.","journal-title":"Proceedings of the IEEE"},{"issue":"2","key":"4_CR20_1","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/0377-2217(93)90181-L","volume":"64","author":"HG Kahlbacher","year":"1993","unstructured":"Kahlbacher, H. G. (1993) Scheduling with monotonous earliness and tardiness penalties, European Journal of Operational Research: 64(2) 258-277.","journal-title":"European Journal of Operational Research"},{"key":"4_CR21_1","first-page":"144","volume":"25","author":"M Raghavachari","year":"1988","unstructured":"Raghavachari, M. (1988) Scheduling problems with non-regular penalty functions: a review, Operations Research: 25 144-164.","journal-title":"Operations Research"},{"key":"4_CR22_1","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1002\/1520-6750(198910)36:5<663::AID-NAV3220360510>3.0.CO;2-X","volume":"36","author":"W Szwarc","year":"1989","unstructured":"Szwarc, W. (1989) Single-machine scheduling to minimize absolute deviation of completion times from a common due date, Naval Research Logistics: 36 663-673.","journal-title":"Naval Research Logistics"},{"key":"4_CR23_1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W. E. (1956) Various optimizers for single-stage production, Naval Research Logistics Quarterly: 3 59-66.","journal-title":"Naval Research Logistics Quarterly"},{"key":"4_CR24_1","doi-asserted-by":"crossref","unstructured":"Dorigo M. and Sttzle T. (2004). Ant Colony Optimization: The MIT Press.","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"4_CR25_1","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1080\/02533839.2005.9671059","volume":"28","author":"C-Y Lee","year":"2005","unstructured":"Lee, C.-Y., Lee, Z.-J. and Su, S.-F. (2005) Ant Colonies With Cooperative Process Applied To Resource Allocation Problem, Journal of the Chinese Institute of Engineers: 28 879-885.","journal-title":"Journal of the Chinese Institute of Engineers"},{"issue":"1","key":"4_CR26_1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S1568-4946(02)00027-3","volume":"2","author":"Z-J Lee","year":"2002","unstructured":"Lee, Z.-J., Lee, C.-Y. and Su, S.-F. (2002) An Immunity Based Ant Colony Optimization Algorithm for Solving Weapon-Target Assignment Problem, Applied Soft Computing 2(1) 39-47.","journal-title":"Applied Soft Computing"},{"key":"4_CR27_1","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/978-3-540-45080-1_37","volume":"2690","author":"Z-J Lee","year":"2003","unstructured":"Lee, Z.-J. and Lee, W.-L. (2003) A Hybrid Search Algorithm of Ant Colony Optimization and Genetic Algorithm Applied to Weapon-Target Assignment Problems, Lecture Notes in Computer Science 2690: 278-285.","journal-title":"Lecture Notes in Computer Science"},{"key":"4_CR28_1","doi-asserted-by":"publisher","first-page":"1445","DOI":"10.1109\/CEC.1999.782653","volume":"2","author":"A Bauer","year":"1999","unstructured":"Bauer, A. et al. (1999) An ant colony optimization approach for the single machine total tardiness problem, Proceedings of the 1999 Congress on Evolutionary Computation: 2 1445-1450.","journal-title":"Proceedings of the 1999 Congress on Evolutionary Computation"},{"key":"4_CR29_1","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1109\/CEC.1999.785494","volume":"3","author":"GN Varela","year":"1999","unstructured":"Varela, G. N. and Sinclair, M. C. (1999) Ant colony optimization for virtual wavelength path routing and wavelength allocation, Proceedings of the 1999 Congress on Evolutionary Computation: 3 1809-1816.","journal-title":"Proceedings of the 1999 Congress on Evolutionary Computation"},{"key":"4_CR30_1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/HICSS.1998.649179","volume":"7","author":"G Dicaro","year":"1998","unstructured":"Dicaro, G. and Dorigo, M. (1998) Mobile agents for adaptive routing, Proceedings of the Thirty-First Hawaii International Conference on System Sciences: 7 74-83.","journal-title":"Proceedings of the Thirty-First Hawaii International Conference on System Sciences"},{"key":"4_CR31_1","doi-asserted-by":"crossref","unstructured":"Yu, I. K., Chou, C. S. and Song,Y. H. (1998) Application of the ant colony search algorithm to short-term generation scheduling problem of thermal units, Proceedings of the 1998 International Conference on Power System Technology: 1 552-556.","DOI":"10.1109\/ICPST.1998.729025"},{"issue":"10","key":"4_CR32_1","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/81.473582","volume":"42","author":"L Nemes","year":"1995","unstructured":"Nemes L. and Roska, T. (1995) A CNN model of oscillation and chaos in ant colonies: a case study, IEEE Transactions on Circuits and Systems I, Fundamental Theory and Applications: 42 (10) 741-745.","journal-title":"Fundamental Theory and Applications"},{"key":"4_CR33_1","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/11839088_46","volume":"4150","author":"Q-K Pan","year":"2006","unstructured":"Pan Q.-K., Tasgetiren M. F. and Liang Y.-C. (2006) Minimizing total earliness and tardiness penalties with a common due date on a single-machine using a discrete particle swarm optimization algorithm, Lecture Notes in Computer Science: 4150 460-467.","journal-title":"Lecture Notes in Computer Science"}],"container-title":["Studies in Computational Intelligence","Metaheuristics for Scheduling in Industrial and Manufacturing Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78985-7_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T16:22:24Z","timestamp":1738340544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78985-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540789840","9783540789857"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78985-7_4","relation":{},"ISSN":["1860-949X"],"issn-type":[{"type":"print","value":"1860-949X"}],"subject":[],"published":{"date-parts":[[2008]]}}}