{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T19:06:36Z","timestamp":1780686396191,"version":"3.54.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,1,9]],"date-time":"2013-01-09T00:00:00Z","timestamp":1357689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10951-012-0305-x","type":"journal-article","created":{"date-parts":[[2013,1,8]],"date-time":"2013-01-08T19:58:37Z","timestamp":1357675117000},"page":"495-518","source":"Crossref","is-referenced-by-count":9,"title":["Enhancing local search algorithms for job shops with min-sum objectives by approximate move evaluation"],"prefix":"10.1007","volume":"16","author":[{"given":"Roland","family":"Braune","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00fcnther","family":"Z\u00e4pfel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Affenzeller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,1,9]]},"reference":[{"issue":"2","key":"305_CR1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0925-5273(99)00014-6","volume":"63","author":"VA Armentano","year":"2000","unstructured":"Armentano, V. A., & Scrich, C. R. (2000). Tabu search for minimizing total tardiness in a job shop. International Journal of Production Economics, 63(2), 131\u2013140.","journal-title":"International Journal of Production Economics"},{"key":"305_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E Balas","year":"1979","unstructured":"Balas, E. (1979). Disjunctive programming. Annals of Discrete Mathematics, 5, 3\u201351.","journal-title":"Annals of Discrete Mathematics"},{"issue":"2","key":"305_CR3","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","volume":"44","author":"E Balas","year":"1998","unstructured":"Balas, E., & Vazacopoulos, A. (1998). Guided local search and the shifting bottleneck for job shop scheduling. Management Science, 44(2), 262\u2013275.","journal-title":"Management Science"},{"issue":"11","key":"305_CR4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J Beasley","year":"1990","unstructured":"Beasley, J. (1990). Or-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11), 1069\u20131072.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"305_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"RE Bellman","year":"1958","unstructured":"Bellman, R. E. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87\u201390.","journal-title":"Quarterly of Applied Mathematics"},{"key":"305_CR6","doi-asserted-by":"crossref","unstructured":"Braune, R., Z\u00e4pfel, G., & Affenzeller, M. (2009). A computational study of lower bounding schemes for total weighted tardiness job shops. In: Proceedings of the 2nd International Symposium on Logistics and Industrial Informatics (LINDI 2009), IEEE Publications, pp 102\u2013107.","DOI":"10.1109\/LINDI.2009.5258570"},{"key":"305_CR7","unstructured":"B\u00fclb\u00fcl, K. (2010). A hybrid shifting bottleneck tabu search heuristic for the job shop total weighted tardiness problem. Technical report. Istanbul: Sabanci University."},{"key":"305_CR8","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1016\/j.cor.2010.09.015","volume":"38","author":"K B\u00fclb\u00fcl","year":"2011","unstructured":"B\u00fclb\u00fcl, K. (2011). A hybrid shifting bottleneck tabu search heuristic for the job shop total weighted tardiness problem. Computers & Operations Research, 38, 967\u2013983.","journal-title":"Computers & Operations Research"},{"issue":"6","key":"305_CR9","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10951-005-4779-7","volume":"8","author":"K Bontridder De","year":"2005","unstructured":"De Bontridder, K. (2005). Minimizing total weighted tardiness in a generalized job shop. Journal of Scheduling, 8(6), 479\u2013496.","journal-title":"Journal of Scheduling"},{"key":"305_CR10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M Dell\u2019Amico","year":"1993","unstructured":"Dell\u2019Amico, M., & Trubian, M. (1993). Applying tabu search to the job-shop scheduling problem. Annals of Operations Research, 41, 231\u2013252.","journal-title":"Annals of Operations Research"},{"key":"305_CR11","doi-asserted-by":"crossref","first-page":"2599","DOI":"10.1016\/j.cor.2006.12.019","volume":"35","author":"I Essafi","year":"2008","unstructured":"Essafi, I., Mati, Y., & Dauz\u00e8re-P\u00e9r\u00e8s, S. (2008). A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Computers & Operations Research, 35, 2599\u20132616.","journal-title":"Computers & Operations Research"},{"key":"305_CR12","volume-title":"Sequencing and scheduling: An introduction to the mathematics of the job shop","author":"S French","year":"1982","unstructured":"French, S. (1982). Sequencing and scheduling: An introduction to the mathematics of the job shop. Chichester: Ellis Horwood."},{"issue":"5","key":"305_CR13","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0167-6377(94)90041-8","volume":"16","author":"J J\u00f3zefowska","year":"1994","unstructured":"J\u00f3zefowska, J., Jurisch, B., & Kubiak, W. (1994). Scheduling shops to minimize the weighted number of late jobs. Operations Research Letters, 16(5), 277\u2013283.","journal-title":"Operations Research Letters"},{"key":"305_CR14","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/s10601-009-9088-x","volume":"16","author":"A Kov\u00e1cs","year":"2011","unstructured":"Kov\u00e1cs, A., & Beck, J. C. (2011). A global constraint for total weighted completion time for unary resources. Constraints, 16, 100\u2013123.","journal-title":"Constraints"},{"key":"305_CR15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<125::AID-JOS40>3.0.CO;2-C","volume":"3","author":"S Kreipl","year":"2000","unstructured":"Kreipl, S. (2000). A large step random walk for minimizing total weighted tardiness in a job shop. Journal of Scheduling, 3, 125\u2013138.","journal-title":"Journal of Scheduling"},{"key":"305_CR16","volume-title":"Resource-constrained project scheduling: An experimental investigation of heuristic scheduling techniques","author":"SR Lawrence","year":"1984","unstructured":"Lawrence, S. R. (1984). Resource-constrained project scheduling: An experimental investigation of heuristic scheduling techniques. Pittsburgh, PA: Graduate School of Industrial Administration, Carnegie-Mellon University."},{"key":"305_CR17","unstructured":"Lin, S. C., Goodman, E. D., Punch, W. F. (1997). A genetic algorithm approach to dynamic job shop scheduling problem. In T. B\u00e4ck (Ed.), Proceedings of the 7th International Conference on Genetic Algorithms (ICGA), Morgan Kaufmann, pp. 481\u2013488."},{"key":"305_CR18","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.ejor.2011.01.046","volume":"212","author":"Y Mati","year":"2011","unstructured":"Mati, Y., Dauz\u00e8re-P\u00e9r\u00e8s, S., & Lahlou, C. (2011). A general approach for optimizing regular criteria in the job-shop scheduling problem. European Journal of Operational Research, 212, 33\u201342.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"305_CR19","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1016\/S0377-2217(03)00016-X","volume":"155","author":"DC Mattfeld","year":"2004","unstructured":"Mattfeld, D. C., & Bierwirth, C. (2004). An efficient genetic algorithm for job shop scheduling with tardiness objectives. European Journal of Operational Research, 155(3), 616\u2013630.","journal-title":"European Journal of Operational Research"},{"key":"305_CR20","volume-title":"Heuristic scheduling systems with applications to production systems and project management","author":"TE Morton","year":"1993","unstructured":"Morton, T. E., & Pentico, D. W. (1993). Heuristic scheduling systems with applications to production systems and project management. New York: Wiley."},{"key":"305_CR21","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","volume":"8","author":"E Nowicki","year":"2005","unstructured":"Nowicki, E., & Smutnicki, C. (2005). An advanced tabu search algorithm for the job shop problem. Journal of Scheduling, 8, 145\u2013159.","journal-title":"Journal of Scheduling"},{"key":"305_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/(SICI)1520-6750(199902)46:1<1::AID-NAV1>3.0.CO;2-#","volume":"46","author":"M Pinedo","year":"1999","unstructured":"Pinedo, M., & Singer, M. (1999). A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics, 46, 1\u201317.","journal-title":"Naval Research Logistics"},{"key":"305_CR23","unstructured":"Roy, B., & Sussmann, B. (1964). Les probl\u00e8mes d\u2019ordonnancement avec contraintes disjonctives. Note D.S. no. 9 bis. Paris: SEMA."},{"key":"305_CR24","unstructured":"Singer, M. (1996). Optimization methods for the total weighted tardiness job shop. PhD thesis, Columbia University."},{"issue":"2","key":"305_CR25","first-page":"109","volume":"30","author":"M Singer","year":"1997","unstructured":"Singer, M., & Pinedo, M. (1997). A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Transactions, 30(2), 109\u2013118.","journal-title":"IIE Transactions"},{"key":"305_CR26","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"RH Storer","year":"1992","unstructured":"Storer, R. H., Wu, S. D., & Vaccari, R. (1992). New search spaces for sequencing problems with application to job shop scheduling. Management Science, 38, 1495\u20131509.","journal-title":"Management Science"},{"key":"305_CR27","unstructured":"Suh, C. J. (1988). Controlled search simulated annealing for job shop scheduling. PhD thesis, University of Texas, Austin."},{"key":"305_CR28","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278\u2013285.","journal-title":"European Journal of Operational Research"},{"key":"305_CR29","doi-asserted-by":"crossref","unstructured":"Taillard, E. (1994). Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing, 6, 108\u2013117.","DOI":"10.1287\/ijoc.6.2.108"},{"issue":"8","key":"305_CR30","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","volume":"33","author":"APJ Vepsalainen","year":"1987","unstructured":"Vepsalainen, A. P. J., & Morton, T. E. (1987). Priority rules for job shops with weighted tardiness costs. Management Science, 33(8), 1035\u20131047.","journal-title":"Management Science"},{"issue":"5","key":"305_CR31","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1080\/002077299292263","volume":"30","author":"TY Wang","year":"1999","unstructured":"Wang, T. Y., & Wu, K. B. (1999). An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm. International Journal of Systems Science, 30(5), 527\u2013532.","journal-title":"International Journal of Systems Science"},{"issue":"4","key":"305_CR32","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1080\/002077200291118","volume":"31","author":"TY Wang","year":"2000","unstructured":"Wang, T. Y., & Wu, K. B. (2000). A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems. International Journal of Systems Science, 31(4), 537\u2013542.","journal-title":"International Journal of Systems Science"},{"key":"305_CR33","doi-asserted-by":"crossref","first-page":"3229","DOI":"10.1016\/j.cor.2005.12.002","volume":"34","author":"C Zhang","year":"2007","unstructured":"Zhang, C., Li, P., Guan, Z., & Rao, Y. (2007). A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Computers & Operations Research, 34, 3229\u20133242.","journal-title":"Computers & Operations Research"},{"key":"305_CR34","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.cor.2006.02.024","volume":"35","author":"CY Zhang","year":"2008","unstructured":"Zhang, C. Y., Li, P., Rao, Y., & Guan, Z. (2008). A very fast TS\/SA algorithm for the job shop scheduling problem. Computers & Operations Research, 35, 282\u2013294.","journal-title":"Computers & Operations Research"},{"key":"305_CR35","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1016\/j.cor.2010.09.014","volume":"38","author":"R Zhang","year":"2011","unstructured":"Zhang, R., & Wu, C. (2011). A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective. Computers & Operations Research, 38, 854\u2013867.","journal-title":"Computers & Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0305-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-012-0305-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0305-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T23:04:51Z","timestamp":1562540691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-012-0305-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,9]]},"references-count":35,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["305"],"URL":"https:\/\/doi.org\/10.1007\/s10951-012-0305-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,9]]}}}