乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T19:33:45Z","timestamp":1726256025433},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,7,14]],"date-time":"2006-07-14T00:00:00Z","timestamp":1152835200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,7,14]],"date-time":"2006-07-14T00:00:00Z","timestamp":1152835200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1007\/s10107-006-0013-4","type":"journal-article","created":{"date-parts":[[2006,7,13]],"date-time":"2006-07-13T14:19:48Z","timestamp":1152800388000},"page":"543-559","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems"],"prefix":"10.1007","volume":"110","author":[{"given":"Yunpeng","family":"Pan","sequence":"first","affiliation":[]},{"given":"Leyuan","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,7,14]]},"reference":[{"key":"13_CR1","first-page":"235","volume":"26","author":"T.S. Abdul-Razaq","year":"1990","unstructured":"Abdul-Razaq T.S., Potts C.N., van Wassenhove L.N. (1990) A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discrete Appl. Math. 26, 235\u2013253","journal-title":"Math."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s101070050071","volume":"85","author":"J.M. van den Akker","year":"1999","unstructured":"van den Akker J.M., van Hoesel C.P.M., Savelsbergh M.W.P. (1999) A polyhedral approach to single-machine scheduling problems. Math. Program. 85, 541\u2013572","journal-title":"Math. Program."},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/ijoc.12.2.111.11896","volume":"12","author":"J.M. van den Akker","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 J. Comput. 12(2): 111\u2013124","journal-title":"INFORMS J. Comput."},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"Applegate D., Cook W. (1991) A computational study of the job-shop scheduling problem. ORSA J. Comput. 3, 149\u2013156","journal-title":"ORSA J. Comput."},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1287\/ijoc.1040.0069","volume":"17","author":"P. Avella","year":"2005","unstructured":"Avella P., Boccia M., D\u2019Auria B. (2005) Near-optimal solutions of large-scale single-machine scheduling problems. INFORMS J. Comput. 17(2): 183\u2013191","journal-title":"INFORMS J. Comput."},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1287\/opre.17.6.941","volume":"17","author":"E. Balas","year":"1969","unstructured":"Balas E. (1969) Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Oper. Res. 17, 941\u2013957","journal-title":"Oper. Res."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas E. (1979) Disjunctive programming. Ann. Discrete Math. 5, 3\u201351","journal-title":"Ann. Discrete Math."},{"key":"13_CR8","unstructured":"Bigras L., Gamache M., Savard G. (2005) Time-indexed formulations and the total weighted tardiness problem. G-2005-30, Les Cahiers du GERAD"},{"key":"13_CR9","unstructured":"B\u00fclb\u00fcl, K., Kaminsky, P., Yano, C. (2005) Preemption in single machine earliness\/tardiness scheduling. J. Sched. Forthcoming"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/S0097539797327180","volume":"31","author":"C. Chekuri","year":"2001","unstructured":"Chekuri C., Motwani R., Natarajan B., Stein C. (2001) Approximation techniques for average completion time scheduling. SIAM J. Comput. 31, 146\u2013166","journal-title":"SIAM J. Comput."},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"13","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 J. Comput. 13(1): 52\u201367","journal-title":"INFORMS J. Comput."},{"key":"13_CR12","doi-asserted-by":"publisher","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 program. Discrete Appl. Math. 26, 255\u2013270","journal-title":"Discrete Appl. Math."},{"key":"13_CR13","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.R. (1974) Coordinnating aggregate and detailed scheduling in the one-machine job shop: Part I. Theory. Oper. Res. 22, 46\u201360","journal-title":"Theory. Oper. Res."},{"issue":"2","key":"13_CR14","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1287\/mnsc.11.2.280","volume":"11","author":"E.L. Lawler","year":"1964","unstructured":"Lawler E.L. (1964) On scheduling problems with deferral costs. Management Sci. 11(2): 280\u2013288","journal-title":"Management Sci."},{"key":"13_CR15","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser G.L., Wolsey L.A. (1988) Integer and Combinatorial Optimization. John Wiley, NY"},{"issue":"6","key":"13_CR16","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/S0167-6377(03)00048-8","volume":"31","author":"Y. Pan","year":"2003","unstructured":"Pan Y. (2003) An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. Oper. Res. Lett. 31(6): 492\u2013496","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","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. Oper. Res. 33(2): 363\u2013377","journal-title":"Oper. Res."},{"key":"13_CR18","unstructured":"Queyranne, M., Schulz, A.S. (1985) Polyhedral approaches to machine scheduling. Preprint 408\/1994, Math. Dept., Tech. Univ. Berlin. Revised June 1997"},{"key":"13_CR19","doi-asserted-by":"publisher","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. J. Sched. 6, 533\u2013549","journal-title":"J. Sched."},{"key":"13_CR20","unstructured":"Sousa J.P. (1989) Time indexed formulations of non-preemptive single-machine scheduling problems. Ph.D. thesis, Facult\u00e9 des Sciences Appliqu\u00e9es, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, Belgium"},{"key":"13_CR21","doi-asserted-by":"publisher","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. Math. Program. 54, 353\u2013367","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0013-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-006-0013-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0013-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0013-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,5]],"date-time":"2024-02-05T08:41:51Z","timestamp":1707122511000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-006-0013-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,14]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["13"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0013-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,14]]},"assertion":[{"value":"4 April 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2006","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2006","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}