{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T06:56:11Z","timestamp":1760424971345},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,9,4]],"date-time":"2009-09-04T00:00:00Z","timestamp":1252022400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10845-009-0309-3","type":"journal-article","created":{"date-parts":[[2009,9,3]],"date-time":"2009-09-03T11:55:22Z","timestamp":1251978922000},"page":"481-490","source":"Crossref","is-referenced-by-count":5,"title":["Single machine scheduling with unequal release date using neuro-dominance rule"],"prefix":"10.1007","volume":"22","author":[{"given":"Tar\u0131k","family":"\u00c7akar","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,4]]},"reference":[{"key":"309_CR1","doi-asserted-by":"crossref","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. (1990) A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discrete Applied Mathematics 26: 235\u2013253","journal-title":"Discrete Applied Mathematics"},{"key":"309_CR2","doi-asserted-by":"crossref","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. (2001) A new dominance rule to minimize total weighted tardiness with unequal release date. European Journal of Operational research 135: 394\u2013412","journal-title":"European Journal of Operational research"},{"issue":"4","key":"309_CR3","doi-asserted-by":"crossref","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. (1998) A new lower bounding scheme for the total weighted tardiness problem. Computers and Operational Research 25(4): 265\u2013278","journal-title":"Computers and Operational Research"},{"issue":"1","key":"309_CR4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/nav.3800290114","volume":"29","author":"L. Bianco","year":"1982","unstructured":"Bianco L., Ricciardelli S. (1982) Sceheduling of a single machine to minimize total weighted completion time subject to release dates. Naval Research Logistics 29(1): 151\u2013167","journal-title":"Naval Research Logistics"},{"key":"309_CR5","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1007\/11424925_129","volume":"3483","author":"T. Cakar","year":"2005","unstructured":"Cakar T. (2005) A new neuro-dominance rule for single machine tardiness problem. Lecture Notes in Computer Science 3483: 1241\u20131250","journal-title":"Lecture Notes in Computer Science"},{"key":"309_CR6","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1007\/11840930_100","volume":"4132","author":"T. Cakar","year":"2006","unstructured":"Cakar T. (2006) A new neuro-dominance rule for single machine tardiness problem with unequal release date. Lecture Notes in Computer Science 4132: 963\u2013973","journal-title":"Lecture Notes in Computer Science"},{"issue":"3\u20134","key":"309_CR7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1024601826420","volume":"14","author":"F. T. S. Chan","year":"2003","unstructured":"Chan F. T. S., Chan H. K., Kazerooni A. (2003) Real time fuzzy scheduling rules in FMS. Journal of Intelligent Manufacturing 14(3\u20134): 341\u2013350","journal-title":"Journal of Intelligent Manufacturing"},{"key":"309_CR8","doi-asserted-by":"crossref","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. (1992) A Branch-and-bound algorithm to minimize total tardiness with unequal release dates. Naval research logistics 39: 265\u2013283","journal-title":"Naval research logistics"},{"key":"309_CR9","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/0377-2217(92)90071-G","volume":"58","author":"C. Chu","year":"1992","unstructured":"Chu C., Portman M. C. (1992) Some new efficient methods to solve the n $${{\\vert} 1 {\\vert}{\\rm r}_{j} {\\vert}\\sum{\\rm w}_{i}{\\rm T}_{i}}$$ scheduling problem. European Journal of Operation Research 58: 404\u2013413","journal-title":"European Journal of Operation Research"},{"key":"309_CR10","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1137\/0210014","volume":"10","author":"M. I. Dessouky","year":"1981","unstructured":"Dessouky M. I., Deogun J. S. (1981) Sequencing jobs with unequal ready times to minimize mean flow time. SIAM Journal of Computing 10: 192\u2013202","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"309_CR11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/A:1008934615349","volume":"11","author":"E. Dudek-Dyduch","year":"2000","unstructured":"Dudek-Dyduch E. (2000) Learning based algorithms in scheduling. Journal of Intelligent Manufacturing 11(2): 135\u2013143","journal-title":"Journal of Intelligent Manufacturing"},{"key":"309_CR12","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1287\/opre.17.4.701","volume":"17","author":"H. Emmons","year":"1969","unstructured":"Emmons H. (1969) One machine sequencing to minimize certain functions of job tardiness. Operations Research 17: 701\u2013715","journal-title":"Operations Research"},{"key":"309_CR13","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1287\/opre.31.1.114","volume":"31","author":"J. Erschler","year":"1983","unstructured":"Erschler J., Fontan G., Merce C., Roubellat F. (1983) A new dominance concept in sceheduling n jobs on a single machine with ready times and due dates. Operations Research 31: 114\u2013127","journal-title":"Operations Research"},{"key":"309_CR14","doi-asserted-by":"crossref","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. (1983) An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Discrete Applied mathematics 5: 99\u2013109","journal-title":"Discrete Applied mathematics"},{"issue":"2","key":"309_CR15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01471219","volume":"2","author":"L. Laguna","year":"1991","unstructured":"Laguna L., Barnes J. W., Glover F. W. (1991) Tabu search methods for a single machine scheduling problem. Journal of Intelligent Manufacturing 2(2): 63\u201374","journal-title":"Journal of Intelligent Manufacturing"},{"key":"309_CR16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"E. L. Lawler","year":"1977","unstructured":"Lawler E. L. (1977) A \u201cpseudopolynomial\u201d algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics 1: 331\u2013342","journal-title":"Annals of Discrete Mathematics"},{"key":"309_CR17","doi-asserted-by":"crossref","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. (1985) A Branch and bound algorithm for total weighted tardiness problem. Operation Research 33: 363\u2013377","journal-title":"Operation Research"},{"key":"309_CR18","doi-asserted-by":"crossref","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. (1987) Dynamic programming and decomposition approaches for the single machine total tardiness problem. European Journal of Operation Research 32: 405\u2013414","journal-title":"European Journal of Operation Research"},{"issue":"23","key":"309_CR19","first-page":"908","volume":"975","author":"R. M. V. Rachamadugu","year":"1987","unstructured":"Rachamadugu R. M. V. (1987) A note on weighted tardiness problem. Operations Research 975(23): 908\u2013927","journal-title":"Operations Research"},{"key":"309_CR20","doi-asserted-by":"crossref","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. (1975) Minimizing total costs in one machine scheduling. Operations Research 23: 908\u2013927","journal-title":"Operations Research"},{"key":"309_CR21","volume-title":"Machine scheduling problems: Classification complexity and computations","author":"A. H. G. Rinnooy Kan","year":"1976","unstructured":"Rinnooy Kan A. H. G. (1976) Machine scheduling problems: Classification complexity and computations. Nijhoff, The Hague"},{"issue":"2","key":"309_CR22","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0377-2217(96)00041-0","volume":"93","author":"I. Sabuncuoglu","year":"1996","unstructured":"Sabuncuoglu I., Gurgun B. (1996) A neural network model for scheduling problems. European Journal of Operational research 93(2): 288\u2013299","journal-title":"European Journal of Operational research"},{"key":"309_CR23","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/mnsc.39.5.626","volume":"39","author":"W. Szwarc","year":"1993","unstructured":"Szwarc W., Liu J. J. (1993) Weighted Tardiness single machine scheduling with proportional weights. Management Science 39: 626\u2013632","journal-title":"Management Science"},{"key":"309_CR24","doi-asserted-by":"crossref","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. (1987) Priority rules for job shops with weighted tardiness cost. management Science 33: 1035\u20131047","journal-title":"management Science"},{"issue":"2","key":"309_CR25","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10845-008-0073-9","volume":"19","author":"G. R. Weckman","year":"2008","unstructured":"Weckman G. R., Ganduri C. V., Koonce D. A. (2008) A Neural network job shop scheduler. Journal of Intelligent Manufacturing 19(2): 191\u2013201","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"6","key":"309_CR26","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1023\/A:1008904604531","volume":"10","author":"S. J. Yim","year":"1999","unstructured":"Yim S. J., Lee D. Y. (1999) Scheduling cluster tools in wafer fabrication using candidate list and simulated annealing. Journal of Intelligent Manufacturing 10(6): 531\u2013540","journal-title":"Journal of Intelligent Manufacturing"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-009-0309-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-009-0309-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-009-0309-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:11:45Z","timestamp":1559268705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-009-0309-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,4]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["309"],"URL":"https:\/\/doi.org\/10.1007\/s10845-009-0309-3","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,4]]}}}