{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:30:59Z","timestamp":1760707859666},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T00:00:00Z","timestamp":1186704000000},"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":[[2007,9,24]]},"DOI":"10.1007\/s10951-007-0028-6","type":"journal-article","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T15:16:45Z","timestamp":1186672605000},"page":"271-292","source":"Crossref","is-referenced-by-count":46,"title":["Preemption in single machine earliness\/tardiness scheduling"],"prefix":"10.1007","volume":"10","author":[{"given":"Kerem","family":"B\u00fclb\u00fcl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip","family":"Kaminsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Candace","family":"Yano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,8,10]]},"reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"K. R. Baker","year":"1990","unstructured":"Baker, K. R., & Scudder, G. D. (1990). Sequencing with earliness and tardiness penalties: a review. Operations Research, 38(1), 22\u201336.","journal-title":"Operations Research"},{"key":"28_CR2","unstructured":"B\u00fclb\u00fcl, K. (2002). Just-in-time scheduling with inventory holding costs. PhD thesis, University of California at Berkeley."},{"issue":"3","key":"28_CR3","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1002\/nav.20000","volume":"51","author":"K. B\u00fclb\u00fcl","year":"2004","unstructured":"B\u00fclb\u00fcl, K., Kaminsky, P., & Yano, C. A. (2004). Flow shop scheduling with earliness, tardiness and intermediate inventory holding costs. Naval Research Logistics, 51(3), 407\u2013445.","journal-title":"Naval Research Logistics"},{"issue":"1","key":"28_CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1002\/1520-6750(199302)40:1<85::AID-NAV3220400106>3.0.CO;2-C","volume":"40","author":"J. Davis","year":"1993","unstructured":"Davis, J., & Kanet, J. (1993). Single-machine scheduling with early and tardy completion costs. Naval Research Logistics, 40(1), 85\u2013101.","journal-title":"Naval Research Logistics"},{"issue":"2\u20133","key":"28_CR5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(90)90104-K","volume":"26","author":"M. Dyer","year":"1990","unstructured":"Dyer, M., & Wolsey, L. (1990). Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics, 26(2\u20133), 255\u2013270.","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"28_CR6","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0305-0548(87)90033-5","volume":"14","author":"T. Fry","year":"1987","unstructured":"Fry, T., & Keong Leong, G. (1987). A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden. Computers and Operations Research, 14(5), 363\u2013368.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"28_CR7","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1080\/07408178708975418","volume":"19","author":"T. Fry","year":"1987","unstructured":"Fry, T., Armstrong, R., & Blackstone, J. (1987). Minimizing weighted absolute deviation in single machine scheduling. IIE Transactions, 19(4), 445\u2013450.","journal-title":"IIE Transactions"},{"issue":"1","key":"28_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0305-0548(90)90033-4","volume":"17","author":"T. Fry","year":"1990","unstructured":"Fry, T., Armstrong, R., & Rosen, L. (1990). Single machine scheduling to minimize mean absolute lateness: a heuristic solution. Computers and Operations Research, 17(1), 105\u2013112.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"28_CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0305-0548(95)00008-A","volume":"23","author":"T. Fry","year":"1996","unstructured":"Fry, T., Armstrong, R., Darby-Dowman, K., & Philipoom, P. (1996). A\u00a0branch and bound procedure to minimize mean absolute lateness on a single processor. Computers and Operations Research, 23(2), 171\u2013182.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"28_CR10","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","volume":"13","author":"M. Garey","year":"1988","unstructured":"Garey, M., Tarjan, R., & Wilfong, G. (1988). One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research, 13(2), 330\u2013348.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"28_CR11","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1287\/opre.22.1.46","volume":"22","author":"L. Gelders","year":"1974","unstructured":"Gelders, L., & Kleindorfer, P. (1974). Coordinating aggregate and detailed scheduling decisions in the one-machine job shop, I:\u00a0theory. Operations Research, 22(1), 46\u201360.","journal-title":"Operations Research"},{"key":"28_CR12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., & Rinnooy Kan, A. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"6","key":"28_CR13","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1287\/opre.49.6.854.10014","volume":"49","author":"N. Hall","year":"2001","unstructured":"Hall, N., & Posner, M. (2001). Generating experimental data for computational testing with machine scheduling applications. Operations Research, 49(6), 854\u2013865.","journal-title":"Operations Research"},{"issue":"4","key":"28_CR14","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1287\/ijoc.8.4.402","volume":"8","author":"J. Hoogeveen","year":"1996","unstructured":"Hoogeveen, J., & van de Velde, S. (1996). A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time. INFORMS Journal on Computing, 8(4), 402\u2013412.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"28_CR15","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/opre.48.1.99.12447","volume":"48","author":"J. Kanet","year":"2000","unstructured":"Kanet, J., & Sridharan, V. (2000). Scheduling with inserted idle time: problem taxonomy and literature review. Operations Research, 48(1), 99\u2013110.","journal-title":"Operations Research"},{"issue":"7","key":"28_CR16","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1002\/1520-6750(199412)41:7<913::AID-NAV3220410705>3.0.CO;2-A","volume":"41","author":"Y.-D. Kim","year":"1994","unstructured":"Kim, Y.-D., & Yano, C. A. (1994). Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates. Naval Research Logistics, 41(7), 913\u2013933.","journal-title":"Naval Research Logistics"},{"issue":"8","key":"28_CR17","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1016\/0305-0548(94)00073-H","volume":"22","author":"C. Lee","year":"1995","unstructured":"Lee, C., & Choi, J. (1995). A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights. Computers and Operations Research, 22(8), 857\u2013869.","journal-title":"Computers and Operations Research"},{"key":"28_CR18","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J. Lenstra","year":"1977","unstructured":"Lenstra, J., Rinnooy Kan, A., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"issue":"1","key":"28_CR19","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0377-2217(99)00345-8","volume":"128","author":"R. Mazzini","year":"2001","unstructured":"Mazzini, R., & Armentano, V. (2001). A heuristic for single machine scheduling with early and tardy costs. European Journal of Operational Research, 128(1), 129\u2013146.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"28_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R. McNaughton","year":"1959","unstructured":"McNaughton, R. (1959). Scheduling with deadlines and loss functions. Management Science, 6(1), 1\u201312.","journal-title":"Management Science"},{"issue":"4","key":"28_CR21","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1080\/09537289608930368","volume":"7","author":"G. Mosheiov","year":"1996","unstructured":"Mosheiov, G. (1996). A note on pre-emptive scheduling with earliness and tardiness costs. Production Planning and Control, 7(4), 401\u2013406.","journal-title":"Production Planning and Control"},{"issue":"6","key":"28_CR22","doi-asserted-by":"crossref","first-page":"1453","DOI":"10.1080\/00207549308956801","volume":"31","author":"U. Nandkeolyar","year":"1993","unstructured":"Nandkeolyar, U., Ahmed, M., & Sundararaghavan, P. (1993). Dynamic single-machine-weighted absolute deviation problem: predictive heuristics and evaluation. International Journal of Production Research, 31(6), 1453\u20131466.","journal-title":"International Journal of Production Research"},{"key":"28_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6329-7","volume-title":"Decomposition methods for complex factory scheduling problems","author":"I. M. Ovacik","year":"1997","unstructured":"Ovacik, I. M., & Uzsoy, R. (1997). Decomposition methods for complex factory scheduling problems. Boston: Kluwer Academic."},{"key":"28_CR24","first-page":"199","volume":"82","author":"C. Phillips","year":"1998","unstructured":"Phillips, C., Stein, C., & Wein, J. (1998). Minimizing average completion time in the presence of release dates. Mathematical Programming, 82, 199\u2013223.","journal-title":"Mathematical Programming"},{"issue":"5","key":"28_CR25","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-6377(82)90035-9","volume":"1","author":"C. Potts","year":"1982","unstructured":"Potts, C., & van Wassenhove, L. (1982). A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters, 1(5), 177\u2013181.","journal-title":"Operations Research Letters"},{"issue":"2","key":"28_CR26","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/ijoc.1030.0034","volume":"16","author":"F. Sourd","year":"2004","unstructured":"Sourd, F. (2004). The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions. INFORMS Journal on Computing, 16(2), 198\u2013208.","journal-title":"INFORMS Journal on Computing"},{"issue":"6","key":"28_CR27","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1023\/A:1026224610295","volume":"6","author":"F. Sourd","year":"2003","unstructured":"Sourd, F., & Kedad-Sidhoum, S. (2003). The one-machine problem with earliness and tardiness penalties. Journal of Scheduling, 6(6), 533\u2013549.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"28_CR28","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/0377-2217(96)00133-6","volume":"94","author":"V. Sridharan","year":"1996","unstructured":"Sridharan, V., & Zhou, Z. (1996). A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems. European Journal of Operational Research, 94(2), 292\u2013301.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"28_CR29","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/nav.3800180304","volume":"18","author":"V. Srinivasan","year":"1971","unstructured":"Srinivasan, V. (1971). A hybrid algorithm for the one machine sequencing problem to minimize total tardiness. Naval Research Logistics Quarterly, 18(3), 317\u2013327.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"2","key":"28_CR30","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/1520-6750(199303)40:2<229::AID-NAV3220400207>3.0.CO;2-R","volume":"40","author":"W. Szwarc","year":"1993","unstructured":"Szwarc, W. (1993). Adjacent orderings in single-machine scheduling with earliness and tardiness penalties. Naval Research Logistics, 40(2), 229\u2013243.","journal-title":"Naval Research Logistics"},{"issue":"7","key":"28_CR31","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1002\/1520-6750(199510)42:7<1109::AID-NAV3220420709>3.0.CO;2-5","volume":"42","author":"W. Szwarc","year":"1995","unstructured":"Szwarc, W., & Mukhopadhyay, S. (1995). Optimal timing schedules in earliness-tardiness single machine sequencing. Naval Research Logistics, 42(7), 1109\u20131114.","journal-title":"Naval Research Logistics"},{"issue":"3","key":"28_CR32","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1016\/S0377-2217(02)00163-7","volume":"144","author":"J. Ventura","year":"2003","unstructured":"Ventura, J., & Radhakrishnan, S. (2003). Single machine scheduling with symmetric earliness and tardiness penalties. European Journal of Operational Research, 144(3), 598\u2013612.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"28_CR33","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1287\/moor.23.4.930","volume":"23","author":"S. Verma","year":"1998","unstructured":"Verma, S., & Dessouky, M. (1998). Single-machine scheduling of unit-time jobs with earliness and tardiness penalties. Mathematics of Operations Research, 23(4), 930\u2013943.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"28_CR34","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0377-2217(01)00302-2","volume":"142","author":"G. Wan","year":"2002","unstructured":"Wan, G., & Yen, B. (2002). Tabu search for single machine scheduling with distinct due windows and weighted earliness\/tardiness penalties. European Journal of Operational Research, 142(2), 271\u2013281.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"28_CR35","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0377-2217(91)90078-A","volume":"52","author":"C. A. Yano","year":"1991","unstructured":"Yano, C. A., & Kim, Y. -D. (1991). Algorithms for a class of single-machine weighted tardiness and earliness problems. European Journal of Operational Research, 52(2), 167\u2013178.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0028-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-007-0028-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0028-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:39Z","timestamp":1559453979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-007-0028-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,10]]},"references-count":35,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2007,9,24]]}},"alternative-id":["28"],"URL":"https:\/\/doi.org\/10.1007\/s10951-007-0028-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,10]]}}}