{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T10:19:30Z","timestamp":1648635570671},"reference-count":19,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2009,6]]},"abstract":"<jats:p> In this paper, we consider the single machine scheduling problem with inventory operations. The objective is to minimize makespan subject to the constraint that the total number of tardy jobs is minimum. We show the problem is strongly NP-hard. A polynomial [Formula: see text]-approximation scheme for the problem is presented, where m is defined as the total job's processing times \u2211 p<jats:sub>j<\/jats:sub> divided by the capacity c of the storage, and an optimal algorithm for a special case of the problem, in which each job is one unit in size. <\/jats:p>","DOI":"10.1142\/s179383090900018x","type":"journal-article","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:53:30Z","timestamp":1246535610000},"page":"227-234","source":"Crossref","is-referenced-by-count":0,"title":["BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS"],"prefix":"10.1142","volume":"01","author":[{"given":"BAOQIANG","family":"FAN","sequence":"first","affiliation":[{"name":"Department of Mathematics and Information, Ludong University, Yantai, 264025, P. R. China"}]},{"given":"RONGJUN","family":"CHEN","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Changzhou Institute of Technology, Changzhou 213002, P. R. China"}]},{"given":"GUOCHUN","family":"TANG","sequence":"additional","affiliation":[{"name":"Institute of Management Engineering, Shanghai Second Polytechnic University, Shanghai 201209, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.38.1.22"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800330206"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(90)90022-Y"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90236-G"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(90)90043-M"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(199302)40:1<85::AID-NAV3220400106>3.0.CO;2-C"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800220314"},{"key":"rf8","volume-title":"Computers and Intactability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2006.01.007"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.07.011"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.39.5.836"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04986-0"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(199412)41:7<913::AID-NAV3220410705>3.0.CO;2-A"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(93)90084-T"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.15.1.102"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)E0140-S"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030106"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1080\/07408179508936738"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383090900018X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:57:57Z","timestamp":1565193477000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S179383090900018X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":19,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2009,6]]}},"alternative-id":["10.1142\/S179383090900018X"],"URL":"https:\/\/doi.org\/10.1142\/s179383090900018x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}