{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:35:20Z","timestamp":1725518120043},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859833"},{"type":"electronic","value":"9783540859840"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85984-0_87","type":"book-chapter","created":{"date-parts":[[2008,9,7]],"date-time":"2008-09-07T21:00:48Z","timestamp":1220821248000},"page":"727-733","source":"Crossref","is-referenced-by-count":1,"title":["A Hybrid VNS with TS for the Single Machine Scheduling Problem to Minimize the Sum of Weighted Tardiness of Jobs"],"prefix":"10.1007","author":[{"given":"Xianpeng","family":"Wang","sequence":"first","affiliation":[]},{"given":"Lixin","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"87_CR1","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"E.L. Lawler","year":"1977","unstructured":"Lawler, E.L.: A Pseudopolynomial Algorithm for Sequencing Jobs to Minimize Total Tardiness. Annals of Discrete Mathematics\u00a01, 331\u2013342 (1977)","journal-title":"Annals of Discrete Mathematics"},{"key":"87_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0166-218X(90)90103-J","volume":"26","author":"T.S. Abdul-Razaq","year":"1990","unstructured":"Abdul-Razaq, T.S., Potts, C.N., VanWassenhove, L.N.: A Survey of Algorithms for the Single Machine Total Weighted Tardiness Scheduling Problem. Discrete Applied Mathematics\u00a026, 235\u2013253 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"87_CR3","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1080\/07408179108963868","volume":"23","author":"C.N. Potts","year":"1991","unstructured":"Potts, C.N., Van Wassenhove, L.N.: Single Machine Tardiness Sequencing Heuristics. IIE Transactions\u00a023, 346\u2013354 (1991)","journal-title":"IIE Transactions"},{"issue":"1","key":"87_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0305-0548(98)00048-3","volume":"26","author":"A. Volgenant","year":"1999","unstructured":"Volgenant, A., Teerhuis, E.: Improved Heuristics for the N-job Single Machine Weighted Tardiness problem. Computers and Operations Research\u00a026(1), 35\u201344 (1999)","journal-title":"Computers and Operations Research"},{"issue":"3","key":"87_CR5","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/ijoc.10.3.341","volume":"10","author":"H.A.J. Crauwels","year":"1998","unstructured":"Crauwels, H.A.J., Potts, C.N., Van Wassenhove, L.N.: Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem. INFORMS Journal on Computing\u00a010(3), 341\u2013350 (1998)","journal-title":"INFORMS Journal on Computing"},{"key":"87_CR6","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1080\/07408170304390","volume":"35","author":"S. Avci","year":"2003","unstructured":"Avci, S., Akturk, M.S., Storer, R.H.: A Problem Space Algorithm for Single Machine Weighted Tardiness Problem. IIE Transactions\u00a035, 479\u2013486 (2003)","journal-title":"IIE Transactions"},{"key":"87_CR7","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1016\/j.ejor.2005.10.030","volume":"176","author":"\u00dc. Bilge","year":"2007","unstructured":"Bilge, \u00dc., Kurtulan, M., K\u0131ra\u00e7, F.: A Tabu Search Algorithm for the Single Machine Total Weighted Tardiness Problem. European Journal of Operational Research\u00a0176, 1423\u20131435 (2007)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"87_CR8","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"14","author":"R.K. Congram","year":"2002","unstructured":"Congram, R.K., Potts, C.N., Van de Velde, S.L.: An Iterated Dynasearch Algorithm for the Single Machine Total Weighted Tardiness Scheduling Problem. INFORMS Journal on Computing\u00a014(1), 52\u201367 (2002)","journal-title":"INFORMS Journal on Computing"},{"key":"87_CR9","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable Neighborhood Search: Principles and Applications. European Journal of Operational Research\u00a0130, 449\u2013467 (2001)","journal-title":"European Journal of Operational Research"},{"key":"87_CR10","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable Neighborhood Search. Computers and Operations Research\u00a024, 1097\u20131100 (1997)","journal-title":"Computers and Operations Research"},{"key":"87_CR11","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover, F.: Future Paths for Integer Programming and Links to Artificial Intelligence. Computers and Operations Research\u00a013, 533\u2013549 (1986)","journal-title":"Computers and Operations Research"},{"issue":"3","key":"87_CR12","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu Search-Part I. ORSA Journal of Computing\u00a01(3), 190\u2013206 (1989)","journal-title":"ORSA Journal of Computing"},{"key":"87_CR13","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1287\/opre.23.5.908","volume":"25","author":"A.H.G. Rinnooy Kan","year":"1975","unstructured":"Rinnooy Kan, A.H.G., Lageweg, B.J., Lenstra, J.K.: Minimizing Total Costs in One-Machine Scheduling. Operations Research\u00a025, 908\u2013927 (1975)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85984-0_87","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T10:38:38Z","timestamp":1580380718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85984-0_87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859833","9783540859840"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85984-0_87","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}