{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T11:47:13Z","timestamp":1767008833492},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2016,6,11]],"date-time":"2016-06-11T00:00:00Z","timestamp":1465603200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Prod. Eng. Res. Devel."],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s11740-016-0680-9","type":"journal-article","created":{"date-parts":[[2016,6,11]],"date-time":"2016-06-11T09:20:56Z","timestamp":1465636856000},"page":"471-476","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Priority allocation rules for single machine total weighted linear and square tardiness problems"],"prefix":"10.1007","volume":"10","author":[{"given":"Aihua","family":"Yin","sequence":"first","affiliation":[]},{"given":"Abraham P.","family":"Punnen","sequence":"additional","affiliation":[]},{"given":"Dongping","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,11]]},"reference":[{"key":"680_CR1","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith WE (1956) Various optimizers for single-stage production. Naval Res Logist Q 3:59\u201366","journal-title":"Naval Res Logist Q"},{"issue":"5","key":"680_CR2","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1287\/mnsc.24.5.530","volume":"24","author":"W Townsend","year":"1978","unstructured":"Townsend W (1978) The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Manag Sci 24(5):530\u2013534","journal-title":"Manag Sci"},{"key":"680_CR3","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/jos.102","volume":"5","author":"SJ Mason","year":"2002","unstructured":"Mason SJ, Fowler JW, Carlyle WM (2002) A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. J Sched 5:247\u2013262","journal-title":"J Sched"},{"key":"680_CR4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Rinnoy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343\u2013362","journal-title":"Ann Discret Math"},{"key":"680_CR5","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":"680_CR6","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","volume":"33","author":"AP Vepsalainen","year":"1987","unstructured":"Vepsalainen AP, Morton TE (1987) Priority rules for job shops with weighted tardiness costs. Manag Sci 33:1035\u20131047","journal-title":"Manag Sci"},{"key":"680_CR7","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/B:JOSH.0000031421.64487.95","volume":"7","author":"JJ Kanet","year":"2004","unstructured":"Kanet JJ, Li X (2004) A weighted modified due date rule for sequencing to minimize weighted tardiness. J Sched 7:261\u2013276","journal-title":"J Sched"},{"key":"680_CR8","doi-asserted-by":"crossref","first-page":"2223","DOI":"10.1016\/j.cor.2011.11.005","volume":"39","author":"Jorge MS Valente","year":"2012","unstructured":"Valente Jorge MS, Schaller Jeffrey E (2012) Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem. Comput Oper Res 39:2223\u20132231","journal-title":"Comput Oper Res"},{"key":"680_CR9","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1016\/j.cor.2011.07.018","volume":"39","author":"Jeffrey E Schaller","year":"2012","unstructured":"Schaller Jeffrey E, Valente Jorge MS (2012) Minimizing the weighted sum of squared tardiness on a single machine. Comput Oper Res 39:919\u2013928","journal-title":"Comput Oper Res"},{"key":"680_CR10","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1080\/07408170304390","volume":"35","author":"S Avci","year":"2003","unstructured":"Avci S, Akturk MS, Storer RH (2003) A problem space algorithm for single machine weighted tardiness problems. IIE Trans 35:479\u2013486","journal-title":"IIE Trans"},{"key":"680_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.orl.2005.01.010","volume":"34","author":"\u00d6 Ergun","year":"2006","unstructured":"Ergun \u00d6, Orlin JB (2006) Fast neighborhood search for the single machine total weighted tardiness problem. Oper Res Lett 34:41\u201345","journal-title":"Oper Res Lett"},{"key":"680_CR12","doi-asserted-by":"crossref","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 (2007) A tabu search algorithm for the single machine total weighted tardiness problem. Eur J Oper Res 176:1423\u20131435","journal-title":"Eur J Oper Res"},{"key":"680_CR13","doi-asserted-by":"crossref","unstructured":"Nearchou AC (2004) Solving the single machine total weighted tardiness scheduling problem using a hybrid simulated annealing algorithm. In: Proceedings of the 2nd IEEE international conference on industrial informatics INDIN\u201904, Berlin, Germany, pp 513\u2013516","DOI":"10.1109\/INDIN.2004.1417398"},{"key":"680_CR14","unstructured":"Geiger M (2011) New instances for the single machine total weighted tardiness problem. http:\/\/edoc.sub.unihmburg.de\/hsu\/volltexte\/2011\/2808\/pdf\/RR-10-03-01.pdf"}],"container-title":["Production Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11740-016-0680-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11740-016-0680-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11740-016-0680-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:11:53Z","timestamp":1498320713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11740-016-0680-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,11]]},"references-count":14,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["680"],"URL":"https:\/\/doi.org\/10.1007\/s11740-016-0680-9","relation":{},"ISSN":["0944-6524","1863-7353"],"issn-type":[{"value":"0944-6524","type":"print"},{"value":"1863-7353","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,11]]}}}