{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:14:59Z","timestamp":1725491699933},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748267"},{"type":"electronic","value":"9783540748274"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74827-4_87","type":"book-chapter","created":{"date-parts":[[2007,9,11]],"date-time":"2007-09-11T23:35:16Z","timestamp":1189553716000},"page":"689-695","source":"Crossref","is-referenced-by-count":3,"title":["An Intelligent Algorithm 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":"Chen-Chia","family":"Chuang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuo-Ching","family":"Ying","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"87_CR1","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"K.R. Baker","year":"1990","unstructured":"Baker, K.R., Scudder, G.D.: Sequencing with Earliness and Tardiness Penalties: A Review. Operations Research\u00a038, 22\u201336 (1990)","journal-title":"Operations Research"},{"key":"87_CR2","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., Feldmann, M.: Benchmarks for Scheduling on A Single Machine Against Restrictive and Unrestrictive Common Due Dates. Computers and Operations Research\u00a028, 787\u2013801 (2001)","journal-title":"Computers and Operations Research"},{"key":"87_CR3","volume-title":"Information Theory, Coding, and Cryptography","author":"R. Bose","year":"2002","unstructured":"Bose, R.: Information Theory, Coding, and Cryptography. McGraw Hill, New York (2002)"},{"key":"87_CR4","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., Chu, C.: A Survey of the State-of-art of Common Due Date Assignment and Scheduling Research. European Journal of Operational Research\u00a0139, 1\u201325 (2002)","journal-title":"European Journal of Operational Research"},{"key":"87_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1023\/B:JMMA.0000036573.01968.1b","volume":"3","author":"J.N.D. Gupta","year":"2004","unstructured":"Gupta, J.N.D., Lauff, V., Werner, F.: Two-machine Flow Shop Problems with Nonregular Criteria. Journal of Mathematical Modelling and Algorithms\u00a03, 123\u2013151 (2004)","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"87_CR6","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.: A Branch-and-Bound Algorithm for the Single Machine Earliness and Tardiness Scheduling Problem. Computers and Operations Research\u00a026, 679\u2013693 (1999)","journal-title":"Computers and Operations Research"},{"key":"87_CR7","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., Ying, K.C.: A Sequential Exchange Approach for Minimizing Earliness-Tardiness Penalties of Single-machine Scheduling with a Common Due Date. European Journal of Operational Search\u00a0177, 1294\u20131301 (2007)","journal-title":"European Journal of Operational Search"},{"key":"87_CR8","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1109\/PROC.1982.12425","volume":"70","author":"E.T. Jaynes","year":"1982","unstructured":"Jaynes, E.T.: On The Rationale of The Maximum Entropy Methods. Proceedings of the IEEE\u00a070, 939\u2013952 (1982)","journal-title":"Proceedings of the IEEE"},{"key":"87_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0377-2217(91)90228-N","volume":"55","author":"J.A. Hoogeveen","year":"1991","unstructured":"Hoogeveen, J.A., Van De Velde, S.L.: Scheduling Around a Small Common Due Date. European Journal and Operational Research\u00a055, 237\u2013242 (1991)","journal-title":"European Journal and Operational Research"},{"key":"87_CR10","volume-title":"Resource Allocation Problems","author":"T. Ibarraki","year":"1988","unstructured":"Ibarraki, T., Katoh, N.: Resource Allocation Problems. The MIT Press, Cambridge, Massachusetts (1988)"},{"key":"87_CR11","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.: A Hybrid Search Algorithm with Heuristics for Resource Allocation Problem. Information sciences\u00a0173, 155\u2013167 (2005)","journal-title":"Information sciences"},{"key":"87_CR12","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., Biskup, D.: Single-machine Scheduling for Minimizing Earliness and Tardiness Penalties by Meta-heuristic Approaches. Computers and Industrial Engineering\u00a044, 307\u2013323 (2003)","journal-title":"Computers and Industrial Engineering"},{"key":"87_CR13","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0305-0548(96)00052-4","volume":"24","author":"R.J.W. James","year":"1997","unstructured":"James, R.J.W.: Using Tabu Search to Solve the Common Due Date Early\/Tardy Machine Scheduling Problem. Computers and Operations Research\u00a024, 199\u2013208 (1997)","journal-title":"Computers and Operations Research"},{"key":"87_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0360-8352(94)00197-U","volume":"28","author":"C.Y. Lee","year":"1995","unstructured":"Lee, C.Y., Kim, S.J.: Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights. Computers and Industrial Engineering\u00a028, 231\u2013243 (1995)","journal-title":"Computers and Industrial Engineering"},{"key":"87_CR15","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., Wu, M.: 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\u00a022, 279\u2013287 (2006)","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"key":"87_CR16","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., Raghavachari, M., Rana, A.I.: A Hybrid Simulated Annealing Approach for Single Machine Scheduling Problems with Non-regular Penalty Functions. Computers and Operations Research\u00a020, 103\u2013111 (1993)","journal-title":"Computers and Operations Research"},{"key":"87_CR17","doi-asserted-by":"crossref","unstructured":"Lin, S.W., Chou, S.Y., Ying, K.C.: Meta-heuristic Approaches for Minimizing Total Earliness and Tardiness Penalties of Single-Machine Scheduling with a Common Due Date. Journal of Heuristics (2007)","DOI":"10.1007\/s10732-006-9002-2"},{"key":"87_CR18","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. The MIT Press, Cambridge (2004)"},{"key":"87_CR19","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1080\/02533839.2005.9671059","volume":"28","author":"C.-Y. Lee","year":"2005","unstructured":"Lee, C.-Y., Lee, Z.-J., Su, S.-F.: Ant Colonies With Cooperative Process Applied To Resource Allocation Problem. Journal of the Chinese Institute of Engineers\u00a028, 879\u2013885 (2005)","journal-title":"Journal of the Chinese Institute of Engineers"},{"key":"87_CR20","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1287\/opre.39.5.847","volume":"39","author":"N.G. Hall","year":"1991","unstructured":"Hall, N.G., Kubiak, W., Sethi, S.P.: Earliness-Tardiness Scheduling Problem, II: Deviation of Completion Times About a Restrictive Common Due Date. Operations Research\u00a039, 847\u2013856 (1991)","journal-title":"Operations Research"},{"key":"87_CR21","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/0377-2217(93)90181-L","volume":"64","author":"H.G. Kahlbacher","year":"1993","unstructured":"Kahlbacher, H.G.: Scheduling with Monotonous Earliness and Tardiness Penalties. European Journal of Operational Research\u00a064, 258\u2013277 (1993)","journal-title":"European Journal of Operational Research"},{"key":"87_CR22","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/S0305-0548(99)00153-7","volume":"28","author":"S.A. Mondal","year":"2001","unstructured":"Mondal, S.A., Sen, A.K.: Single Machine Weighted Earliness-Tardiness Penalty Problem with a Common Due Date. Computers and Operations Research\u00a028, 649\u2013669 (2001)","journal-title":"Computers and Operations Research"},{"key":"87_CR23","first-page":"144","volume":"25","author":"M. Raghavachari","year":"1988","unstructured":"Raghavachari, M.: Scheduling Problems with Non-regular Penalty Functions: A Review. Operations Research\u00a025, 144\u2013164 (1988)","journal-title":"Operations Research"},{"key":"87_CR24","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.: Single-machine Scheduling to Minimize Absolute Deviation of Completion Times from a Common Due Date. Naval Research Logistics\u00a036, 663\u2013673 (1989)","journal-title":"Naval Research Logistics"},{"key":"87_CR25","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.ejor.2004.03.006","volume":"160","author":"C.M. Hino","year":"2005","unstructured":"Hino, C.M., Ronconi, D.P., Mendes, A.B.: Minimizing Earliness and Tardiness Penalties in a Single-machine Problem with a Common Due Date. European Journal of Operational Research\u00a0160, 190\u2013201 (2005)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Knowledge-Based Intelligent Information and Engineering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74827-4_87","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T14:34:31Z","timestamp":1550932471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74827-4_87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540748267","9783540748274"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74827-4_87","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}