{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:26:22Z","timestamp":1725575182589},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540258636"},{"type":"electronic","value":"9783540323099"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11424925_129","type":"book-chapter","created":{"date-parts":[[2011,1,15]],"date-time":"2011-01-15T16:14:27Z","timestamp":1295108067000},"page":"1241-1250","source":"Crossref","is-referenced-by-count":4,"title":["A New Neuro-Dominance Rule for Single Machine Tardiness Problem"],"prefix":"10.1007","author":[{"given":"Tar\u0131k","family":"\u00c7akar","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"129_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0272-6963(95)00028-Q","volume":"13","author":"J.B. Jensen","year":"1995","unstructured":"Jensen, J.B., Philipoom, P.R., Malhotra, M.K.: Evaluation of scheduling Rules with commensurate customer priorities in job shops. Journal of operation management\u00a013, 213\u2013228 (1995)","journal-title":"Journal of operation management"},{"key":"129_CR2","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"E.L. Lawler","year":"1997","unstructured":"Lawler, E.L.: A \u201cPseudopolynomial\u201d algorithm for sequencing job to minimize total tardiness. Annals of Discrete Mathematics\u00a01, 331\u2013342 (1997)","journal-title":"Annals of Discrete Mathematics"},{"key":"129_CR3","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1287\/opre.39.4.639","volume":"39","author":"R.J. Chambers","year":"1991","unstructured":"Chambers, R.J., Carraway, R.L., Lowe, T.J., Morin, T.L.: Dominance and decomposition heuristics for single machine scheduling. Operation Research\u00a039, 639\u2013647 (1991)","journal-title":"Operation Research"},{"key":"129_CR4","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1287\/opre.17.4.701","volume":"17","author":"H. Emmons","year":"1969","unstructured":"Emmons, H.: One machine sequencing to minimize certain functions of job tardiness. Operation Research\u00a017, 701\u2013715 (1969)","journal-title":"Operation Research"},{"key":"129_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01580393","volume":"11","author":"M.L. Fisher","year":"1976","unstructured":"Fisher, M.L.: A dual algorithm for the one-machine scheduling problem. Mathematical Programming\u00a011, 229\u2013251 (1976)","journal-title":"Mathematical Programming"},{"key":"129_CR6","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/opre.33.2.363","volume":"33","author":"C.N. Potts","year":"1985","unstructured":"Potts, C.N., Van Wassenhove, L.N.: A Branch and bound algorithmfor total weighted tardiness problem. Operation Research\u00a033, 363\u2013377 (1985)","journal-title":"Operation Research"},{"key":"129_CR7","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/S0377-2217(87)80008-5","volume":"32","author":"C.N. Potts","year":"1987","unstructured":"Potts, C.N., Van Wassenhove, L.N.: Dynamic programming and decomposition approaches for the single machine total tardiness problem. European Journal of Operation Research\u00a032, 405\u2013414 (1987)","journal-title":"European Journal of Operation Research"},{"key":"129_CR8","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1287\/opre.23.5.908","volume":"23","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\u00a023, 908\u2013927 (1975)","journal-title":"Operations Research"},{"key":"129_CR9","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., Van Wassenhove, 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":"129_CR10","doi-asserted-by":"crossref","unstructured":"Hoogeveen, J.A., Van de Velde, S.L.: Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems. Mathematical Programming\u00a0195(70), 173\u2013190","DOI":"10.1007\/BF01585935"},{"key":"129_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/1520-6750(199303)40:2<229::AID-NAV3220400207>3.0.CO;2-R","volume":"40","author":"W. Szwarc","year":"1993","unstructured":"Szwarc, W.: Adjacent orderings in single machine scheduling with earliness and tardiness penalties. Naval research Logistics\u00a040, 229\u2013243 (1993)","journal-title":"Naval research Logistics"},{"key":"129_CR12","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1287\/mnsc.39.5.626","volume":"39","author":"W. Szwarc","year":"1993","unstructured":"Szwarc, W., Liu, J.J.: Weighted Tardines single machine scheduling with proportional weights. Management Science\u00a039, 626\u2013632 (1993)","journal-title":"Management Science"},{"key":"129_CR13","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","volume":"33","author":"A.P.J. Vepsalainen","year":"1987","unstructured":"Vepsalainen, A.P.J., Morton, T.E.: Priority rules for job shops with weighted tardiness cost. Management Science\u00a033, 1035\u20131047 (1987)","journal-title":"Management Science"},{"issue":"2","key":"129_CR14","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0377-2217(96)00041-0","volume":"93","author":"I. Sabuncuoglu","year":"1996","unstructured":"Sabuncuoglu, I., Gurgun, B.: A neural network model for scheduling problems. European Journal of Operational research\u00a093(2), 288\u2013299 (1996)","journal-title":"European Journal of Operational research"},{"key":"129_CR15","doi-asserted-by":"publisher","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.: A new dominance rule to minimize total weighted tardiness with unequal release date. European Journal of Operational research\u00a0135, 394\u2013412 (2001)","journal-title":"European Journal of Operational research"},{"issue":"4","key":"129_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0305-0548(97)00073-7","volume":"25","author":"M.S. Akturk","year":"1998","unstructured":"Akturk, M.S., Yidirim, M.B.: A new lower bounding scheme for the total weighted tardiness problem. Computers and Operational Research\u00a025(4), 265\u2013278 (1998)","journal-title":"Computers and Operational Research"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11424925_129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T23:39:02Z","timestamp":1558309142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11424925_129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258636","9783540323099"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11424925_129","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}