{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T22:42:31Z","timestamp":1770504151062,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Methods of Operations Research"],"published-print":{"date-parts":[[1996,2]]},"DOI":"10.1007\/bf01303431","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T10:22:35Z","timestamp":1111746155000},"page":"1-8","source":"Crossref","is-referenced-by-count":44,"title":["Single machine batch scheduling to minimize the weighted number of late jobs"],"prefix":"10.1007","volume":"43","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail Y.","family":"Kovalyov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(93)90085-3","volume":"47","author":"S Albers","year":"1993","unstructured":"Albers S, Bracker P (1993) The complexity of one-machine batching problems. Discrete Applied Mathematics 47:87?107","journal-title":"Discrete Applied Mathematics"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Brucker P (1991) Scheduling problems in connection with flexible production systems. In Proceedings, 1991 IEEE Int Conf on Robotics and Automation 1778?1783","DOI":"10.1109\/ROBOT.1991.131880"},{"key":"CR3","volume-title":"On batch delivery scheduling on a single machine, Preprint N 9","author":"TCE Cheng","year":"1992","unstructured":"Cheng TCE, Gordon VS (1992) On batch delivery scheduling on a single machine, Preprint N 9, Institute of Engineering Cybernetics, Belarus Academy of Sciences, Minsk"},{"key":"CR4","unstructured":"Cheng TCE, Gordon VS, Kovalyov MY (1994) Single machine scheduling with batch deliveries. (in submission)"},{"key":"CR5","first-page":"145","volume":"10","author":"TCE Cheng","year":"1993","unstructured":"Cheng TCE, Kahlbacher HG (1993) Scheduling with delivery and earliness penalties. Asia-Pacific Journal of Operational Research 10:145?152","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/opre.37.3.426","volume":"37","author":"EG Coffman","year":"1989","unstructured":"Coffman EG, Nozari A, Yannakakis M (1989) Optimal scheduling of products with two subassemblies on a single machine. Operations Research 37:426?436","journal-title":"Operations Research"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF02248589","volume":"26","author":"EG Coffman","year":"1990","unstructured":"Coffman EG, Yannakakis M, Magazine MJ, Santos C (1990) Batch sizing and sequencing on a single machine. Annals of Operations Research 26:135?147","journal-title":"Annals of Operations Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1287\/mnsc.33.6.784","volume":"33","author":"G Dobson","year":"1987","unstructured":"Dobson G, Karmarkar US, Rummel JL (1987) Batching to minimize flow times on one machine. Management Science 33:784?799","journal-title":"Management Science"},{"key":"CR9","volume-title":"Computers and intractability: A guide to the theory ofN P-completenss","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: A guide to the theory ofN P-completenss. W.H. Freeman and Co, New York"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Hochbaum DS, Landy D (1994) Scheduling with batching: minimizing the weighted number of tardy jobs, (to appear in Operations Research Letters)","DOI":"10.1016\/0167-6377(94)90063-9"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of Computer Computations. Plenum Press, New York 85?103"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0167-6377(94)90063-9","volume":"16","author":"MY Kovalyov","year":"1994","unstructured":"Kovalyov MY (1994) Improving the complexities of approximation algorithms for optimization problems. Operations Research Letters 16:79?86","journal-title":"Operations Research Letters"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"EL Lawler","year":"1969","unstructured":"Lawler EL, Moore JM (1969) A functional equation and its application to resource allocation and sequencing problems. Management Science 16:77?84","journal-title":"Management Science"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0166-218X(88)90049-2","volume":"21","author":"D Naddef","year":"1988","unstructured":"Naddef D, Santos C (1988) One-pass batching algorithms for the one machine problem. Discrete Applied Mathematics 21:133?145","journal-title":"Discrete Applied Mathematics"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"43","author":"CN Potts","year":"1991","unstructured":"Potts CN, Van Wassenhove LN (1991) Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. Journal of the Operational Research Society 43:395?406","journal-title":"Journal of the Operational Research Society"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/mnsc.12.5.437","volume":"12","author":"MH Rothkopf","year":"1966","unstructured":"Rothkopf MH (1966) Scheduling independent tasks on parallel processors. Management Science 12:437?447","journal-title":"Management Science"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01303431.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01303431\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01303431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:59:18Z","timestamp":1586181558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01303431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["BF01303431"],"URL":"https:\/\/doi.org\/10.1007\/bf01303431","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}