{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T10:07:57Z","timestamp":1773482877651,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T00:00:00Z","timestamp":1225929600000},"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":[[2009,12]]},"DOI":"10.1007\/s10951-008-0093-5","type":"journal-article","created":{"date-parts":[[2008,11,5]],"date-time":"2008-11-05T16:58:35Z","timestamp":1225904315000},"page":"575-593","source":"Crossref","is-referenced-by-count":74,"title":["An exact algorithm for single-machine scheduling without\u00a0machine idle time"],"prefix":"10.1007","volume":"12","author":[{"given":"Shunji","family":"Tanaka","sequence":"first","affiliation":[]},{"given":"Shuji","family":"Fujikuma","sequence":"additional","affiliation":[]},{"given":"Mituhiko","family":"Araki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,6]]},"reference":[{"key":"93_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1057\/jors.1988.26","volume":"39","author":"T. S. Abdul-Razaq","year":"1988","unstructured":"Abdul-Razaq, T. S., & Potts, C. N. (1988). Dynamic programming state\u2013space relaxation for single-machine scheduling. Journal of the Operational Research Society, 39, 141\u2013152.","journal-title":"Journal of the Operational Research Society"},{"key":"93_CR2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230110207","volume":"11","author":"N. Christofides","year":"1981","unstructured":"Christofides, N., Mingozzi, A., & Toth, P. (1981). State\u2013space relaxation procedures for the computation of bounds to routing problems. Networks, 11, 145\u2013164.","journal-title":"Networks"},{"key":"93_CR3","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"14","author":"R. K. Congram","year":"2002","unstructured":"Congram, R. K., Potts, C. N., & van de Velde, S. L. (2002). An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, 14, 52\u201367.","journal-title":"INFORMS Journal on Computing"},{"key":"93_CR4","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/ijoc.10.3.341","volume":"10","author":"H. A. J. Crauwels","year":"1998","unstructured":"Crauwels, H. A. J., Potts, C. N., & Van Wassenhove, L. N. (1998). Local search heuristics for the single machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, 10, 341\u2013350.","journal-title":"INFORMS Journal on Computing"},{"key":"93_CR5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(90)90104-K","volume":"26","author":"M. E. Dyer","year":"1990","unstructured":"Dyer, M. E., & Wolsey, L. A. (1990). Formulating the single-machine sequencing problem with release dates as a mixed integer problem. Discrete Applied Mathematics, 26, 255\u2013270.","journal-title":"Discrete Applied Mathematics"},{"key":"93_CR6","doi-asserted-by":"crossref","first-page":"1114","DOI":"10.1287\/opre.21.5.1114","volume":"21","author":"M. L. Fisher","year":"1973","unstructured":"Fisher, M. L. (1973). Optimal solution of scheduling problems using Lagrange multipliers: part I. Operations Research, 21, 1114\u20131127.","journal-title":"Operations Research"},{"key":"93_CR7","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/inte.15.2.10","volume":"15","author":"M. L. Fisher","year":"1985","unstructured":"Fisher, M. L. (1985). An applications oriented guide to Lagrangian relaxation. Interfaces, 15, 10\u201321.","journal-title":"Interfaces"},{"key":"93_CR8","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0167-6377(03)00064-6","volume":"32","author":"A. Grosso","year":"2004","unstructured":"Grosso, A., Della Croce, F., & Tadei, R. (2004). An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Operations Research Letters, 32, 68\u201372.","journal-title":"Operations Research Letters"},{"key":"93_CR9","unstructured":"Ibaraki, T. (1987). Enumerative approaches to combinatorial optimization. Annals of Operations Research, 10\u201311."},{"key":"93_CR10","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/0377-2217(94)90007-8","volume":"76","author":"T. Ibaraki","year":"1994","unstructured":"Ibaraki, T., & Nakamura, Y. (1994). A dynamic programming method for single machine scheduling. European Journal of Operational Research, 76, 72\u201382.","journal-title":"European Journal of Operational Research"},{"key":"93_CR11","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1016\/S0305-0548(98)00081-1","volume":"26","author":"C.-F. Liaw","year":"1999","unstructured":"Liaw, C.-F. (1999). A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Computers & Operations Research, 26, 679\u2013693.","journal-title":"Computers & Operations Research"},{"key":"93_CR12","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10107-006-0013-4","volume":"110","author":"Y. Pan","year":"2007","unstructured":"Pan, Y., & Shi, L. (2007). On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems. Mathematical Programming, Series A, 110, 543\u2013559.","journal-title":"Mathematical Programming, Series A"},{"key":"93_CR13","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1016\/S0377-2217(02)00438-1","volume":"148","author":"L. P\u00e9ridy","year":"2003","unstructured":"P\u00e9ridy, L., Pinson, \u00c9., & Rivreau, D. (2003). Using short-term memory to minimize the weighted number of late jobs on a single machine. European Journal of Operational Research, 148, 591\u2013603.","journal-title":"European Journal of Operational Research"},{"key":"93_CR14","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 the total weighted tardiness problem. Operations Research, 33, 363\u2013377.","journal-title":"Operations Research"},{"key":"93_CR15","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/mnsc.16.1.93","volume":"16","author":"A. A. B. Pritsker","year":"1969","unstructured":"Pritsker, A. A. B., Watters, L. J., & Wolfe, P. M. (1969). Multiproject scheduling with limited resources: a zero-one programming approach. Management Science, 16, 93\u2013108.","journal-title":"Management Science"},{"key":"93_CR16","unstructured":"Sourd, F. (2006). A reinforced Lagrangean relaxation for non-preemptive single machine problem. In Proceedings of tenth international workshop on project management and scheduling, Pozna\u0144, Poland, 26\u201328 April 2006."},{"key":"93_CR17","doi-asserted-by":"crossref","unstructured":"Sourd, F. (2008). New exact algorithms for one-machine earliness-tardiness scheduling. INFORMS Journal on Computing. doi: 10.1287\/ijoc.1080.0287","DOI":"10.1287\/ijoc.1080.0287"},{"key":"93_CR18","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01586059","volume":"54","author":"J. P. Sousa","year":"1992","unstructured":"Sousa, J. P., & Wolsey, L. A. (1992). A time indexed formulation of non-preemptive single machine scheduling problems. Mathematical Programming, 54, 353\u2013367.","journal-title":"Mathematical Programming"},{"key":"93_CR19","unstructured":"Tanaka, S., Fujikuma, S., & Araki, M. (2006). A branch-and-bound algorithm based on Lagrangian relaxation for single-machine scheduling. In Proceedings of international symposium on scheduling 2006 (pp. 148\u2013153), Tokyo, Japan, 18\u201320 July 2006."},{"key":"93_CR20","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s10107990047a","volume":"85","author":"J. M. Akker van den","year":"1999","unstructured":"van den Akker, J. M., van Hoesel, C. P. M., & Savelsbergh, M.\u00a0W.\u00a0P. (1999). A polyhedral approach to single-machine scheduling problems. Mathematical Programming, 85, 541\u2013572.","journal-title":"Mathematical Programming"},{"key":"93_CR21","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/ijoc.12.2.111.11896","volume":"12","author":"J. M. Akker van den","year":"2000","unstructured":"van den Akker, J. M., Hurkens, C. A. J., & Savelsbergh, M. W. P. (2000). Time-indexed formulations for machine scheduling problems: Column generation. INFORMS Journal on Computing, 12, 111\u2013124.","journal-title":"INFORMS Journal on Computing"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0093-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-008-0093-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0093-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:42Z","timestamp":1559453982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-008-0093-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,6]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["93"],"URL":"https:\/\/doi.org\/10.1007\/s10951-008-0093-5","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,6]]}}}