{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T17:47:09Z","timestamp":1769276829313,"version":"3.49.0"},"reference-count":41,"publisher":"Emerald","issue":"10","license":[{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IMDS"],"published-print":{"date-parts":[[2022,11,2]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title><jats:p>In intelligent scheduling, parallel batch processing can reasonably allocate production resources and reduce the production cost per unit product. Hence, the research on a parallel batch scheduling problem (PBSP) with uncertain job size is of great significance to realize the flexibility of product production and mass customization of personalized products.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title><jats:p>The authors propose a robust formulation in which the job size is defined by budget constrained support. For obtaining the robust solution of the robust PBSP, the authors propose an exact algorithm based on branch-and-price framework, where the pricing subproblem can be reduced to a robust shortest path problem with resource constraints. The robust subproblem is transformed into a deterministic mixed integer programming by duality. A series of deterministic shortest path problems with resource constraints is derived from the programming for which the authors design an efficient label-setting algorithm with a strong dominance rule.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Findings<\/jats:title><jats:p>The authors test the performance of the proposed algorithm on the extension of benchmark instances in literature and compare the infeasible rate of robust and deterministic solutions in simulated scenarios. The authors' results show the efficiency of the authors' algorithm and importance of incorporating uncertainties in the problem.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title><jats:p>This work is the first to study the PBSP with uncertain size. To solve this problem, the authors design an efficient exact algorithm based on Dantzig\u2013Wolfe decomposition. This can not only enrich the intelligent manufacturing theory related to parallel batch scheduling but also provide ideas for relevant enterprises to solve problems.<\/jats:p><\/jats:sec>","DOI":"10.1108\/imds-12-2021-0807","type":"journal-article","created":{"date-parts":[[2022,5,20]],"date-time":"2022-05-20T03:58:55Z","timestamp":1653019135000},"page":"2351-2370","source":"Crossref","is-referenced-by-count":5,"title":["A branch-and-price algorithm for robust parallel batch scheduling problem with uncertain size"],"prefix":"10.1108","volume":"122","author":[{"given":"Ting","family":"Wang","sequence":"first","affiliation":[]},{"given":"Xiaoling","family":"Shao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8161-5159","authenticated-orcid":false,"given":"Xue","family":"Yan","sequence":"additional","affiliation":[]}],"member":"140","published-online":{"date-parts":[[2022,5,23]]},"reference":[{"key":"key2022110106342439100_ref001","volume-title":"Robust Optimization","year":"2009"},{"key":"key2022110106342439100_ref002","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1021\/ie030529f","article-title":"Risk management in the scheduling of batch plants under uncertain market demand","volume":"43","year":"2004","journal-title":"Industrial and Engineering Chemistry Research"},{"key":"key2022110106342439100_ref003","article-title":"The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times","volume":"123","year":"2020","journal-title":"Computers and Operations Research"},{"key":"key2022110106342439100_ref004","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1002\/(SICI)1520-6750(199612)43:8<1127::AID-NAV5>3.0.CO;2-G","article-title":"Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties","volume":"43","year":"1996","journal-title":"Naval Research Logistics"},{"key":"key2022110106342439100_ref005","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1016\/j.ejor.2009.04.011","article-title":"Operating room planning and scheduling: a literature review","volume":"201","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"key2022110106342439100_ref006","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/j.ejor.2016.02.040","article-title":"Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic","volume":"253","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"key2022110106342439100_ref007","first-page":"423","article-title":"Scheduling of a multiproduct batch plant under multiperiod demand uncertainties by means of a rolling horizon strategy","volume-title":"19th European Symposium on Computer Aided Process Engineering","year":"2009"},{"key":"key2022110106342439100_ref008","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","article-title":"Decomposition principle for linear programs","volume":"8","year":"1960","journal-title":"Operations Research"},{"key":"key2022110106342439100_ref009","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.cor.2019.03.001","article-title":"Robust single machine scheduling with a flexible maintenance activity","volume":"107","year":"2019","journal-title":"Computers and Operations Research"},{"key":"key2022110106342439100_ref010","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","article-title":"The price of robustness","volume":"52","year":"2004","journal-title":"Operations Research"},{"key":"key2022110106342439100_ref011","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10462-018-9667-6","article-title":"A state of the art review of intelligent scheduling","volume":"53","year":"2020","journal-title":"Artificial Intellidence Review"},{"key":"key2022110106342439100_ref012","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2021.06.012","article-title":"A survey of scheduling with parallel batch (p-batch) processing","volume":"298","year":"2022","journal-title":"European Journal of Operational Research"},{"key":"key2022110106342439100_ref013","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.compind.2003.09.004","article-title":"A framework to support customer\u2013company interaction in mass customization environments","volume":"54","year":"2004","journal-title":"Computers in Industry"},{"key":"key2022110106342439100_ref014","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1287\/opre.1120.1136","article-title":"The robust capacitated vehicle routing problem under demand uncertainty","volume":"61","year":"2013","journal-title":"Operations Research"},{"key":"key2022110106342439100_ref015","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.omega.2014.07.004","article-title":"The two-dimensional vector packing problem with piecewise linear cost function","volume":"50","year":"2015","journal-title":"Omega"},{"key":"key2022110106342439100_ref016","article-title":"IBM ILOG CPLEX 12.8.0 concert library","author":"IBM CPLEX","year":"2019"},{"key":"key2022110106342439100_ref017","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.jmsy.2011.01.001","article-title":"Design of reconfigurable manufacturing systems","volume":"29","year":"2010","journal-title":"Journal of Manufacturing Systems"},{"key":"key2022110106342439100_ref018","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1016\/j.ejor.2021.12.030","article-title":"A mixed integer linear programming support vector machine for cost-effective group feature selection: branch-cut-and-price approach","volume":"299","year":"2022","journal-title":"European Journal of Operational Research"},{"key":"key2022110106342439100_ref019","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1016\/j.ejor.2018.12.019","article-title":"The robust vehicle routing problem with time windows: solution by branch and price and cut","volume":"275","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"key2022110106342439100_ref020","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/j.ejor.2020.01.065","article-title":"Exact algorithms to minimize makespan on single and parallel batch processing machines","volume":"285","year":"2020","journal-title":"European Journal of Operational Research"},{"key":"key2022110106342439100_ref021","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.cor.2018.08.007","article-title":"Distributionally robust single machine scheduling with the total tardiness criterion","volume":"101","year":"2019","journal-title":"Computers and Operations Research"},{"key":"key2022110106342439100_ref022","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1016\/j.ejor.2020.03.044","article-title":"A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time","volume":"286","year":"2020","journal-title":"European Journal of Operational Research"},{"key":"key2022110106342439100_ref023","first-page":"1","article-title":"A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan","volume":"55","year":"2017","journal-title":"International Journal of Production Research"},{"key":"key2022110106342439100_ref024","doi-asserted-by":"crossref","first-page":"1720","DOI":"10.1016\/j.cor.2009.12.007","article-title":"A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes","volume":"37","year":"2010","journal-title":"Computers and Operations Research"},{"key":"key2022110106342439100_ref025","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.ejor.2014.11.034","article-title":"Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan","volume":"244","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"key2022110106342439100_ref026","first-page":"269","volume-title":"An Integer Programming Approach to Scheduling","year":"1981"},{"key":"key2022110106342439100_ref027","article-title":"A branch-and-price algorithm for the robust single-source capacitated facility location problem under demand uncertainty","volume":"11","year":"2022","journal-title":"EURO Journal on Transportation and Logistics"},{"key":"key2022110106342439100_ref028","article-title":"Big data driven supply chain management: a framework for implementing analytics and turning information into intelligence","year":"2014"},{"key":"key2022110106342439100_ref029","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1016\/j.ejor.2021.05.041","article-title":"Solving robust bin-packing problems with a branch-and-price approach","volume":"297","year":"2022","journal-title":"European Journal of Operational Research"},{"key":"key2022110106342439100_ref031","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/j.jclepro.2009.10.014","article-title":"Project feasibility study: the key to successful implementation of sustainable and socially responsible construction management practice","volume":"18","year":"2010","journal-title":"Journal of Cleaner Production"},{"key":"key2022110106342439100_ref032","first-page":"547","article-title":"Adjustable robust optimization for scheduling of batch processes under uncertainty","volume-title":"26th European Symposium on Computer Aided Process Engineering","year":"2016"},{"key":"key2022110106342439100_ref033","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1080\/24725854.2018.1468122","article-title":"The robust machine availability problem \u2013 bin packing under uncertainty","volume":"50","year":"2018","journal-title":"IISE Transactions"},{"key":"key2022110106342439100_ref034","doi-asserted-by":"crossref","first-page":"7031","DOI":"10.1080\/00207543.2018.1424371","article-title":"Modelling and symmetry breaking in scheduling problems on batch processing machines","volume":"56","year":"2018","journal-title":"International Journal of Production Research"},{"key":"key2022110106342439100_ref035","article-title":"Arc-flow approach for single batch-processing machine scheduling","year":"2020"},{"key":"key2022110106342439100_ref036","doi-asserted-by":"crossref","first-page":"7231","DOI":"10.1080\/00207543.2016.1174789","article-title":"Big data analytics for forecasting cycle time in semiconductor wafer fabrication system","volume":"54","year":"2016","journal-title":"International Journal of Production Research"},{"key":"key2022110106342439100_ref037","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10951-019-00623-9","article-title":"Mixed batch scheduling on identical machines","volume":"23","year":"2020","journal-title":"Journal of Scheduling"},{"key":"key2022110106342439100_ref038","article-title":"Robust (min\u2013max regret) single machine scheduling with interval processing times and total tardiness criterion","volume":"149","year":"2020","journal-title":"Computers and Industrial Engineering"},{"key":"key2022110106342439100_ref039","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.trb.2013.08.014","article-title":"Demand uncertainty and airport capacity choice","volume":"57","year":"2013","journal-title":"Transportation Research Part B Methodological"},{"key":"key2022110106342439100_ref040","first-page":"124","article-title":"Robust single machine scheduling problem with uncertain job due dates for industrial mass production","volume":"31","year":"2020","journal-title":"Journal of Systems Engineering and Electronics"},{"key":"key2022110106342439100_ref041","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.orl.2013.05.003","article-title":"Solving two-stage robust optimization problems using a column-and-constraint generation method","volume":"41","year":"2013","journal-title":"Operations Research Letters"},{"key":"key2022110106342439100_ref042","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1287\/ijoc.2018.0807","article-title":"Exact algorithms for distributionally beta-robust machine scheduling with uncertain processing times","volume":"30","year":"2018","journal-title":"Informs Journal on Computing"}],"container-title":["Industrial Management &amp; Data Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IMDS-12-2021-0807\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IMDS-12-2021-0807\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:54:27Z","timestamp":1753394067000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/imds\/article\/122\/10\/2351-2370\/187094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,23]]},"references-count":41,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2022,5,23]]},"published-print":{"date-parts":[[2022,11,2]]}},"alternative-id":["10.1108\/IMDS-12-2021-0807"],"URL":"https:\/\/doi.org\/10.1108\/imds-12-2021-0807","relation":{},"ISSN":["0263-5577"],"issn-type":[{"value":"0263-5577","type":"print"}],"subject":[],"published":{"date-parts":[[2022,5,23]]}}}