{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:07:36Z","timestamp":1725469656016},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388715"},{"type":"electronic","value":"9783540388739"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11840930_100","type":"book-chapter","created":{"date-parts":[[2006,8,31]],"date-time":"2006-08-31T18:14:12Z","timestamp":1157048052000},"page":"963-973","source":"Crossref","is-referenced-by-count":1,"title":["A New Neuro-Dominance Rule for Single Machine Tardiness Problem with Unequal Release Dates"],"prefix":"10.1007","author":[{"given":"Tar\u0131k","family":"\u00c7akar","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"100_CR1","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"},{"key":"100_CR2","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/0377-2217(92)90071-G","volume":"58","author":"C. Chu","year":"1992","unstructured":"Chu, C., Portman, M.C.: Some new efficient methods to solve the n| 1 | r\n                    i\n                   | \u03a3w\n                    i\n                  T\n                    i\n                   scheduling problem. European Journal of Operation Research\u00a058, 404\u2013413 (1992)","journal-title":"European Journal of Operation Research"},{"unstructured":"Rinnooy Kan, A.H.G.: Machine sceheduling problems: Classification complexity and omputations, Nijhoff, The Hague (1976)","key":"100_CR3"},{"key":"100_CR4","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1287\/opre.23.5.908","volume":"23","author":"R.M.V. Rachamadugu","year":"1975","unstructured":"Rachamadugu, R.M.V.: A note on weighted tardiness problem. Operations Research\u00a023, 908\u2013927 (1975)","journal-title":"Operations Research"},{"key":"100_CR5","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":"100_CR6","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"},{"issue":"4","key":"100_CR7","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"},{"key":"100_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1007\/11424925_129","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2005","author":"T. Cakar","year":"2005","unstructured":"Cakar, T.: A New Neuro-dominance rule for single machine tardiness problem. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Lagan\u00e1, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol.\u00a03483, pp. 1241\u20131250. Springer, Heidelberg (2005)"},{"key":"100_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-L","volume":"39","author":"C. Chu","year":"1992","unstructured":"Chu, C.: A Branch-and-bound algorithm to minimize total tardiness with unequal release dates. Naval research logistics\u00a039, 265\u2013283 (1992)","journal-title":"Naval research logistics"},{"key":"100_CR10","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1137\/0210014","volume":"10","author":"M.I. Dessouky","year":"1981","unstructured":"Dessouky, M.I., Deogun, J.S.: Sequencing jobs with unequal ready times to inimize mean flow time. SIAM Journal of Computing\u00a010, 192\u2013202 (1981)","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"100_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/nav.3800290114","volume":"29","author":"L. Bianco","year":"1982","unstructured":"Bianco, L., Ricciardelli, S.: Sceheduling of a single machine to minimize total weighted completion time subject to release dates. Naval Research Logistics\u00a029(1), 151\u2013167 (1982)","journal-title":"Naval Research Logistics"},{"key":"100_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0166-218X(83)90019-7","volume":"5","author":"A.M.A. Hariri","year":"1983","unstructured":"Hariri, A.M.A., Potts, C.N.: An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Discrete Applied Mathematics\u00a05, 99\u2013109 (1983)","journal-title":"Discrete Applied Mathematics"},{"key":"100_CR13","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 algorithm for total weighted tardiness problem. Operation Research\u00a033, 363\u2013377 (1985)","journal-title":"Operation Research"},{"key":"100_CR14","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"},{"key":"100_CR15","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":"100_CR16","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"},{"issue":"2","key":"100_CR17","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"}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks \u2013 ICANN 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11840930_100.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:19Z","timestamp":1619507779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11840930_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388715","9783540388739"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11840930_100","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}