{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T23:26:21Z","timestamp":1779924381890,"version":"3.53.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0166-218x(03)00339-1","type":"journal-article","created":{"date-parts":[[2003,7,22]],"date-time":"2003-07-22T16:46:14Z","timestamp":1058892374000},"page":"1-24","source":"Crossref","is-referenced-by-count":50,"title":["Open shop scheduling problems with late work criteria"],"prefix":"10.1016","volume":"134","author":[{"given":"Jacek","family":"B\u0142a\u017cewicz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erwin","family":"Pesch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ma\u0142gorzata","family":"Sterna","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(03)00339-1_BIB1","series-title":"Networks Flows: Theory, Algorithms and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0166-218X(03)00339-1_BIB2","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<245::AID-JOS28>3.0.CO;2-5","article-title":"Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine when processing times are equal","volume":"2","author":"Baptiste","year":"1999","journal-title":"J. Scheduling"},{"key":"10.1016\/S0166-218X(03)00339-1_BIB3","series-title":"Foundations of Real-time Computing: Scheduling and Resource Management","first-page":"129","article-title":"Recent results in real-time scheduling","author":"Bettati","year":"1991"},{"key":"10.1016\/S0166-218X(03)00339-1_BIB4","first-page":"415","article-title":"Scheduling preemptible tasks on parallel processors with information loss","volume":"3","author":"B\u0142a\u017cewicz","year":"1984","journal-title":"Rech. Tech. Sci. Inform."},{"key":"10.1016\/S0166-218X(03)00339-1_BIB5","series-title":"Scheduling Computer and Manufacturing Processes","author":"B\u0142a\u017cewicz","year":"2001"},{"key":"10.1016\/S0166-218X(03)00339-1_BIB6","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0020-0190(87)90145-1","article-title":"Minimizing mean weighted execution time loss on identical and uniform processors","volume":"24","author":"B\u0142a\u017cewicz","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(03)00339-1_BIB7","series-title":"Operations Research Proceedings, 1999","first-page":"354","article-title":"Total late work criteria for shop scheduling problems","author":"B\u0142a\u017cewicz","year":"2000"},{"key":"10.1016\/S0166-218X(03)00339-1_BIB8","series-title":"Scheduling Algorithms","author":"Brucker","year":"1998"},{"key":"10.1016\/S0166-218X(03)00339-1_BIB9","series-title":"Operations Research. A Practical Introduction","author":"Carter","year":"2001"},{"key":"10.1016\/S0166-218X(03)00339-1_BIB10","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1287\/opre.29.3.511","article-title":"Preemptive scheduling of independent jobs with release and due times on open, flow and job shops","volume":"29","author":"Cho","year":"1981","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(03)00339-1_BIB11","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/0165-6074(89)90146-4","article-title":"Scheduling imprecise computations to minimize total error","volume":"27","author":"Chung","year":"1989","journal-title":"Microprocess. Microprogramming"},{"key":"10.1016\/S0166-218X(03)00339-1_BIB12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1111\/j.1467-9574.1990.tb01276.x","article-title":"Scheduling identical jobs on uniform parallel machines","volume":"44","author":"Dessouky","year":"1990","journal-title":"Statist. Neerlandica"},{"key":"10.1016\/S0166-218X(03)00339-1_BIB13","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(03)00339-1_BIB14","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","article-title":"Open shop scheduling to minimize finish time","volume":"23","author":"Gonzalez","year":"1976","journal-title":"J. Assoc. Comput. Mach. ACM"},{"key":"10.1016\/S0166-218X(03)00339-1_BIB15","unstructured":"K. Ho, J.Y.T. Leung, W.D. Wei, Minimizing constrained maximum weighted error for doubly weighted tasks, Technical Report UNL-CSE-92-018, University of Nebraska, 1992."},{"key":"10.1016\/S0166-218X(03)00339-1_BIB16","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1006\/jagm.1994.1020","article-title":"Minimizing maximum weighted error for imprecise computation tasks","volume":"16","author":"Ho","year":"1994","journal-title":"J. Algorithms"},{"issue":"5","key":"10.1016\/S0166-218X(03)00339-1_BIB17","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0167-6377(94)90041-8","article-title":"Scheduling shops to minimize the weighted number of late jobs","volume":"16","author":"J\u00f3zefowska","year":"1994","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(03)00339-1_BIB18","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/moor.6.1.153","article-title":"Minimizing maximum lateness in a two-machine open shop","volume":"6","author":"Lawler","year":"1981","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(03)00339-1_BIB19","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(03)00339-1_BIB20","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(80)90111-3","article-title":"Complexity results for scheduling chains on a single machine","volume":"4","author":"Lenstra","year":"1980","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0166-218X(03)00339-1_BIB21","series-title":"Operation Scheduling with Applications in Manufacturing and Services","author":"Pinedo","year":"1999"},{"issue":"3","key":"10.1016\/S0166-218X(03)00339-1_BIB22","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/opre.40.3.586","article-title":"Single machine scheduling to minimize total late work","volume":"40","author":"Potts","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(03)00339-1_BIB23","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0167-6377(92)90001-J","article-title":"Approximation algorithms for scheduling a single machine to minimize total late work","volume":"11","author":"Potts","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(03)00339-1_BIB24","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1137\/0220035","article-title":"Algorithms for scheduling imprecise computations with timing constraints","volume":"20","author":"Shih","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00339-1_BIB25","series-title":"Deadline Scheduling for Real-Time Systems","author":"Stankievic","year":"1998"},{"key":"10.1016\/S0166-218X(03)00339-1_BIB26","series-title":"Problems and Algorithms in Non-Classical Shop Scheduling","author":"Sterna","year":"2000"},{"key":"10.1016\/S0166-218X(03)00339-1_BIB27","unstructured":"http:\/\/www.mathematik.uni-osnabrueck.de\/research\/OR\/class\/"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003391?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003391?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T06:55:25Z","timestamp":1552805725000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03003391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":27,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0166218X03003391"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00339-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}