{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:39:28Z","timestamp":1761597568671},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,1,6]],"date-time":"2015-01-06T00:00:00Z","timestamp":1420502400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s00521-014-1789-4","type":"journal-article","created":{"date-parts":[[2015,1,5]],"date-time":"2015-01-05T02:06:17Z","timestamp":1420423577000},"page":"1439-1450","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A new neuro-dominance rule for single-machine tardiness problem with double due date"],"prefix":"10.1007","volume":"26","author":[{"given":"Tarik","family":"Cakar","sequence":"first","affiliation":[]},{"given":"Ra\u015fit","family":"K\u00f6ker","sequence":"additional","affiliation":[]},{"given":"Ozkan","family":"Canay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,6]]},"reference":[{"key":"1789_CR1","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1016\/j.cie.2011.01.017","volume":"60","author":"CJ Hsu","year":"2011","unstructured":"Hsu CJ, Yang SJ, Yang DL (2011) Two due date assignment problems with position dependent processing time on a single machine. Comput Ind Eng 60:796\u2013800","journal-title":"Comput Ind Eng"},{"issue":"57\u201362","key":"1789_CR2","first-page":"2009","volume":"198","author":"VS Gordon","year":"2009","unstructured":"Gordon VS, Strusevich VA (2009) Single machine scheduling and due date assignment with positionally dependent processing times. Eur J Oper Res 198(57\u201362):2009","journal-title":"Eur J Oper Res"},{"key":"1789_CR3","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1016\/j.orl.2005.10.009","volume":"34","author":"D Shabtay","year":"2006","unstructured":"Shabtay D, Steiner G (2006) Two due date assignment problems in scheduling a single machine. Oper Res Lett 34:683\u2013691","journal-title":"Oper Res Lett"},{"issue":"6","key":"1789_CR4","doi-asserted-by":"crossref","first-page":"1182","DOI":"10.1109\/TSMCA.2011.2116005","volume":"41","author":"C Wang","year":"2011","unstructured":"Wang C (2011) Due-date management through iterative bidding. IEEE Trans Syst Man Cybern\u2014Part A Syst Hum 41(6):1182\u20131198","journal-title":"IEEE Trans Syst Man Cybern\u2014Part A Syst Hum"},{"issue":"6","key":"1789_CR5","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/s10951-010-0181-1","volume":"13","author":"JM Akker Van den","year":"2010","unstructured":"Van den Akker JM, Diepen G, Hoogeveen JA (2010) Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs. J Sched 13(6):561\u2013576","journal-title":"J Sched"},{"issue":"11","key":"1789_CR6","doi-asserted-by":"crossref","first-page":"4126","DOI":"10.1016\/j.camwa.2011.09.063","volume":"62","author":"JQ Li","year":"2011","unstructured":"Li JQ, Yuan XH, Lee ES, Xu DH (2011) Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine. Comput Math Appl 62(11):4126\u20134139","journal-title":"Comput Math Appl"},{"key":"1789_CR7","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1016\/j.amc.2007.10.013","volume":"199","author":"T Kellegoz","year":"2008","unstructured":"Kellegoz T, Toklu B, Wilson J (2008) Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem. Appl Math Comput 199:590\u2013598","journal-title":"Appl Math Comput"},{"issue":"1","key":"1789_CR8","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1057\/jors.2009.186","volume":"62","author":"SH Yoon","year":"2011","unstructured":"Yoon SH, Lee IS (2011) New constructive heuristics for the total weighted tardiness problem. J Oper Res Soc 62(1):232\u2013237","journal-title":"J Oper Res Soc"},{"issue":"3","key":"1789_CR9","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manag Sci 34(3):391\u2013401","journal-title":"Manag Sci"},{"issue":"6","key":"1789_CR10","doi-asserted-by":"crossref","first-page":"2122","DOI":"10.1016\/j.cor.2008.08.004","volume":"36","author":"AB Colka Altunc","year":"2009","unstructured":"Colka Altunc AB, Burak Keha A (2009) Interval-indexed formulation based heuristics for single machine total weighted tardiness problem. Comput Oper Res 36(6):2122\u20132131","journal-title":"Comput Oper Res"},{"key":"1789_CR11","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"EL Lawler","year":"1997","unstructured":"Lawler EL (1997) A \u201cPseudopolynomial\u201d algorithm for sequencing job to minimize total tardiness. Ann Discret Math 1:331\u2013342","journal-title":"Ann Discret Math"},{"key":"1789_CR12","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1287\/opre.39.4.639","volume":"39","author":"RJ Chambers","year":"1991","unstructured":"Chambers RJ, Carraway RL, Lowe TJ, Morin TL (1991) Dominance and decomposition heuristics for single machine scheduling. Oper Res 39:639\u2013647","journal-title":"Oper Res"},{"key":"1789_CR13","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. Oper Res 17:701\u2013715","journal-title":"Oper Res"},{"key":"1789_CR14","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1287\/opre.23.5.908","volume":"23","author":"AHG Rinnooy Kan","year":"1975","unstructured":"Rinnooy Kan AHG, Lageweg BJ, Lenstra JK (1975) Minimizing total costs in one machine scheduling. Oper Res 23:908\u2013927","journal-title":"Oper Res"},{"key":"1789_CR15","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01580393","volume":"11","author":"ML Fisher","year":"1976","unstructured":"Fisher ML (1976) A dual algorithm for the one-machine scheduling problem. Math Progr 11:229\u2013251","journal-title":"Math Progr"},{"key":"1789_CR16","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.33.2.363","volume":"33","author":"CN Potts","year":"1985","unstructured":"Potts CN, Van Wassenhove LN (1985) A branch and bound algorithm for total weighted tardiness problem. Oper Res 33:363\u2013377","journal-title":"Oper Res"},{"key":"1789_CR17","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0377-2217(87)80008-5","volume":"32","author":"CN Potts","year":"1987","unstructured":"Potts CN, Van Wassenhove LN (1987) Dynamic programming and decomposition approaches for the single machine total tardiness problem. Eur J Oper Res 32:405\u2013414","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1789_CR18","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. Eur J Oper Res 93(2):288\u2013299","journal-title":"Eur J Oper Res"},{"key":"1789_CR19","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0166-218X(90)90103-J","volume":"26","author":"TS Abdul-Razaq","year":"1990","unstructured":"Abdul-Razaq TS, Potts CN, Van Wassenhove LN (1990) A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discret Appl Math 26:235\u2013253","journal-title":"Discret Appl Math"},{"issue":"6","key":"1789_CR20","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1007\/s10845-009-0253-2","volume":"21","author":"W Bozejko","year":"2010","unstructured":"Bozejko W (2010) Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups. J Intell Manuf 21(6):777\u2013785","journal-title":"J Intell Manuf"},{"issue":"1","key":"1789_CR21","first-page":"147","volume":"26","author":"H Cheng","year":"2009","unstructured":"Cheng H, Yixun L, Ruyan F (2009) Bicriteria scheduling with double due dates to minimize the maximum lateness. Chin J Eng Math 26(1):147\u2013150","journal-title":"Chin J Eng Math"},{"issue":"6","key":"1789_CR22","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1080\/03052150802657290","volume":"41","author":"M Mahnam","year":"2009","unstructured":"Mahnam M, Moslehi G (2009) A branch-and-bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times. Eng Optim 41(6):521\u2013536","journal-title":"Eng Optim"},{"issue":"10","key":"1789_CR23","doi-asserted-by":"crossref","first-page":"1811","DOI":"10.1080\/00207721003653716","volume":"42","author":"K Li","year":"2011","unstructured":"Li K, Yang SL, Ren ML (2011) Single machine scheduling problem with resource dependent release dates to minimize total resource-consumption. Int J Syst Sci 42(10):1811\u20131820","journal-title":"Int J Syst Sci"},{"key":"1789_CR24","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1016\/j.ejor.2010.06.031","volume":"207","author":"MJ Geiger","year":"2010","unstructured":"Geiger MJ (2010) On heuristic search for the single machine total weighted tardiness problem\u2014some theoretical insights and their empirical verification. Eur J Oper Res 207:1235\u20131243","journal-title":"Eur J Oper Res"},{"key":"1789_CR25","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/j.amc.2008.12.001","volume":"208","author":"T Eren","year":"2009","unstructured":"Eren T (2009) Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect. Appl Math Comput 208:355\u2013358","journal-title":"Appl Math Comput"},{"key":"1789_CR26","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1016\/j.cie.2010.07.028","volume":"59","author":"KR Kenneth","year":"2010","unstructured":"Kenneth KR, Keller B (2010) Solving the single-machine sequencing problem using integer programming. Comput Ind Eng 59:730\u2013735","journal-title":"Comput Ind Eng"},{"key":"1789_CR27","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","volume":"33","author":"APJ Vepsalainen","year":"1987","unstructured":"Vepsalainen APJ, Morton TE (1987) Priority rules for job shops with weighted tardiness cost. Manag Sci 33:1035\u20131047","journal-title":"Manag Sci"},{"issue":"4","key":"1789_CR28","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0305-0548(97)00073-7","volume":"25","author":"MS Akturk","year":"1998","unstructured":"Akturk MS, Yidirim MB (1998) A new lower bounding scheme for the total weighted tardiness problem. Comput Oper Res 25(4):265\u2013278","journal-title":"Comput Oper Res"},{"issue":"3","key":"1789_CR29","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1287\/moor.1070.0255","volume":"32","author":"JJ Kanet","year":"2007","unstructured":"Kanet JJ (2007) New precedence theorems for one-machine weighted tardiness. Math Oper Res 32(3):579\u2013588","journal-title":"Math Oper Res"},{"key":"1789_CR30","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/j.ejor.2010.11.008","volume":"212","author":"A Jouglet","year":"2011","unstructured":"Jouglet A, Carlier J (2011) Dominance rules in combinatorial optimization problems. Eur J Oper Res 212:433\u2013444","journal-title":"Eur J Oper Res"},{"key":"1789_CR31","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/S0377-2217(00)00319-2","volume":"135","author":"MS Akturk","year":"2001","unstructured":"Akturk MS, Ozdemir D (2001) A new dominance rule to minimize total weighted tardiness with unequal release date. Eur J Oper Res 135:394\u2013412","journal-title":"Eur J Oper Res"},{"key":"1789_CR32","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. Lect Notes Comput Sci 3483:1241\u20131250","journal-title":"Lect Notes Comput Sci"},{"key":"1789_CR33","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s10845-009-0309-3","volume":"22","author":"T Cakar","year":"2011","unstructured":"Cakar T (2011) Single machine scheduling with unequal release date using neuro-dominance rule. J Intell Manuf 22:481\u2013490","journal-title":"J Intell Manuf"},{"issue":"3\u20134","key":"1789_CR34","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1024601826420","volume":"14","author":"FTS Chan","year":"2003","unstructured":"Chan FTS, Chan HK, Kazerooni A (2003) Real time fuzzy scheduling rules in FMS. J Intell Manuf 14(3\u20134):341\u2013350","journal-title":"J Intell Manuf"},{"issue":"2","key":"1789_CR35","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. J Intell Manuf 11(2):135\u2013143","journal-title":"J Intell Manuf"},{"issue":"2","key":"1789_CR36","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01471219","volume":"2","author":"L Laguna","year":"1991","unstructured":"Laguna L, Barnes JW, Glover FW (1991) Tabu search methods for a single machine scheduling problem. J Intell Manuf 2(2):63\u201374","journal-title":"J Intell Manuf"},{"issue":"2","key":"1789_CR37","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10845-008-0073-9","volume":"19","author":"GR Weckman","year":"2008","unstructured":"Weckman GR, Ganduri CV, Koonce DA (2008) A neural network job shop scheduler. J Intell Manuf 19(2):191\u2013201","journal-title":"J Intell Manuf"},{"issue":"6","key":"1789_CR38","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1023\/A:1008904604531","volume":"10","author":"SJ Yim","year":"1999","unstructured":"Yim SJ, Lee DY (1999) Scheduling cluster tools in wafer fabrication using candidate list and simulated annealing. J Intell Manuf 10(6):531\u2013540","journal-title":"J Intell Manuf"},{"issue":"4598","key":"1789_CR39","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"key":"1789_CR40","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.ijepes.2013.04.010","volume":"53","author":"EB Schlunz","year":"2013","unstructured":"Schlunz EB, Van Vuuren JH (2013) \u201cAn investigation into the effectiveness of simulated annealing as a solution approach for the generator maintenance scheduling problem. Electr Power Energy Syst 53:166\u2013174","journal-title":"Electr Power Energy Syst"},{"issue":"4","key":"1789_CR41","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s00366-012-0277-7","volume":"29","author":"R K\u00f6ker","year":"2013","unstructured":"K\u00f6ker R (2013) A neuro-simulated annealing approach to the inverse kinematics solution of redundant robotic manipulators. Eng Comput 29(4):507\u2013515","journal-title":"Eng Comput"},{"key":"1789_CR42","first-page":"153","volume-title":"Parallel robot scheduling with genetic algorithms","author":"T \u00c7akar","year":"2008","unstructured":"\u00c7akar T, Yazgan HR, K\u00f6ker R (2008) Parallel robot manipulators, new developments. In: Ryu J-H (ed) Parallel robot scheduling with genetic algorithms. I-Tech Education and Publishing, Vienna, pp 153\u2013170"},{"issue":"1","key":"1789_CR43","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.advengsoft.2006.11.003","volume":"39","author":"T \u00c7akar","year":"2008","unstructured":"\u00c7akar T, K\u00f6ker R, Demir I (2008) Parallel robot scheduling to minimize mean tardiness with precedence constraints using a genetic algorithm. Adv Eng Softw 39(1):47\u201354","journal-title":"Adv Eng Softw"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-014-1789-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-014-1789-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-014-1789-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T22:21:17Z","timestamp":1559082077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-014-1789-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,6]]},"references-count":43,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["1789"],"URL":"https:\/\/doi.org\/10.1007\/s00521-014-1789-4","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,6]]}}}