{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:51:24Z","timestamp":1758268284876},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2014,8]]},"abstract":"<jats:p> In this paper, the problem of minimizing maximum cost and makespan simultaneously on an unbounded parallel-batching machine is considered. An unbounded parallel-batching machine is a machine that can handle any number of jobs in a batch and the processing time of a batch is the largest processing time of jobs in the batch. The main goal of a multicriteria problem is to find Pareto optimal solutions. We present a polynomial-time algorithm to produce all Pareto optimal solutions of this bicriteria scheduling problem. <\/jats:p>","DOI":"10.1142\/s0217595914500250","type":"journal-article","created":{"date-parts":[[2014,2,26]],"date-time":"2014-02-26T12:18:25Z","timestamp":1393417105000},"page":"1450025","source":"Crossref","is-referenced-by-count":8,"title":["BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN"],"prefix":"10.1142","volume":"31","author":[{"given":"CHENG","family":"HE","sequence":"first","affiliation":[{"name":"School of Science, Henan University of Technology, Zhengzhou, Henan 450001, People's Republic of China"}]},{"given":"HAO","family":"LIN","sequence":"additional","affiliation":[{"name":"School of Science, Henan University of Technology, Zhengzhou, Henan 450001, People's Republic of China"}]},{"given":"JINJIANG","family":"YUAN","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, People's Republic of China"}]},{"given":"YUNDONG","family":"MU","sequence":"additional","affiliation":[{"name":"School of Science, Henan University of Technology, Zhengzhou, Henan 450001, People's Republic of China"}]}],"member":"219","published-online":{"date-parts":[[2014,8,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022231419049"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04550-3"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.04.034"},{"key":"rf6","first-page":"369","volume":"33","author":"He C.","year":"2008","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.02.007"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0051"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.07.011"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(95)00023-D"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595914500250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T19:23:42Z","timestamp":1565119422000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595914500250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":10,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2014,8,20]]},"published-print":{"date-parts":[[2014,8]]}},"alternative-id":["10.1142\/S0217595914500250"],"URL":"https:\/\/doi.org\/10.1142\/s0217595914500250","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8]]}}}