{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T12:03:59Z","timestamp":1784894639745,"version":"3.55.0"},"reference-count":42,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["202208070096"],"award-info":[{"award-number":["202208070096"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.cor.2026.107567","type":"journal-article","created":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T08:06:09Z","timestamp":1780473969000},"page":"107567","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A stochastic bi-objective unrelated parallel machine scheduling under time-of-use tariffs"],"prefix":"10.1016","volume":"194","author":[{"given":"Xiechen","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6759-809X","authenticated-orcid":false,"given":"Eric","family":"Angel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feng","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Damien","family":"Regnault","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.cor.2026.107567_b1","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1016\/j.ejor.2020.07.020","article-title":"A bi-objective heuristic approach for green identical parallel machine scheduling","volume":"289","author":"Anghinolfi","year":"2021","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107567_b2","article-title":"Green scheduling with time-of-use tariffs and machine states: Optimizing energy cost via branch-and-bound and bin packing strategies","author":"Benedikt","year":"2025","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107567_b3","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1016\/j.ejor.2023.01.029","article-title":"Job scheduling under time-of-use energy tariffs for sustainable manufacturing: a survey","volume":"308","author":"Catanzaro","year":"2023","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107567_b4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/mnsc.6.1.73","article-title":"Chance-constrained programming","volume":"6","author":"Charnes","year":"1959","journal-title":"Manag. Sci."},{"key":"10.1016\/j.cor.2026.107567_b5","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1016\/j.jclepro.2017.04.018","article-title":"Energy-conscious unrelated parallel machine scheduling under time-of-use electricity tariffs","volume":"156","author":"Che","year":"2017","journal-title":"J. Clean. Prod."},{"key":"10.1016\/j.cor.2026.107567_b6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10479-021-04059-3","article-title":"Optimal algorithms for scheduling under time-of-use tariffs","volume":"304","author":"Chen","year":"2021","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107567_b7","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1016\/j.ejor.2018.11.002","article-title":"Scheduling with time-of-use costs","volume":"274","author":"Chen","year":"2019","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107567_b8","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1109\/TASE.2016.2631491","article-title":"An improved model for parallel machine scheduling under time-of-use electricity price","volume":"15","author":"Cheng","year":"2017","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.cor.2026.107567_b9","series-title":"Efficient Algorithms for Unrelated Parallel Machine Scheduling Considering Time of Use Pricing and Demand Charges","author":"Collea","year":"2020"},{"issue":"4","key":"10.1016\/j.cor.2026.107567_b10","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1080\/00207543.2018.1504245","article-title":"A novel branch-and-bound algorithm for the chance-constrained resource-constrained project scheduling problem","volume":"57","author":"Davari","year":"2019","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107567_b11","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/j.techfore.2017.02.007","article-title":"Understanding the failure to understand new product development failures: Mitigating the uncertainty associated with innovating new products by combining scenario planning and forecasting","volume":"125","author":"Derbyshire","year":"2017","journal-title":"Technol. Forecast. Soc. Change"},{"issue":"4","key":"10.1016\/j.cor.2026.107567_b12","doi-asserted-by":"crossref","first-page":"1340","DOI":"10.1137\/080724514","article-title":"Small approximate Pareto sets for biobjective shortest paths and other problems","volume":"39","author":"Diakonikolas","year":"2010","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107567_b13","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1109\/TASE.2015.2495328","article-title":"Parallel machine scheduling under time-of-use electricity prices: New models and optimization approaches","volume":"13","author":"Ding","year":"2015","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"1\u20132","key":"10.1016\/j.cor.2026.107567_b14","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1080\/00207543.2023.2228922","article-title":"Robust identical parallel machine scheduling with two-stage time-of-use tariff and not-all-machine option","volume":"62","author":"Feng","year":"2024","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107567_b15","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1016\/j.ejor.2023.05.040","article-title":"Exact and heuristic solution approaches for energy-efficient identical parallel machine scheduling with time-of-use costs","volume":"311","author":"Gaggero","year":"2023","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107567_b16","series-title":"Optimization and Decision Science: Methodologies and Applications","first-page":"253","article-title":"A computational journey in job scheduling with time-of-use costs","volume":"vol. 12","author":"Gaggero","year":"2024"},{"key":"10.1016\/j.cor.2026.107567_b17","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discret. Math."},{"key":"10.1016\/j.cor.2026.107567_b18","series-title":"Gurobi Optimizer Reference Manual","author":"Gurobi","year":"2024"},{"issue":"1","key":"10.1016\/j.cor.2026.107567_b19","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10898-020-00951-7","article-title":"One-exact approximate Pareto sets","volume":"80","author":"Herzel","year":"2021","journal-title":"J. Global Optim."},{"issue":"4","key":"10.1016\/j.cor.2026.107567_b20","first-page":"1284","article-title":"Approximation methods for multiobjective optimization problems: A survey","volume":"33","author":"Herzel","year":"2021","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2026.107567_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105788","article-title":"Exact method to optimize the total electricity cost in two-machine permutation flow shop scheduling problem under time-of-use tariff","volume":"144","author":"Ho","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107567_b22","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106754","article-title":"Epsilon oscillation algorithm for the bi-objective green identical parallel machine scheduling problem","volume":"170","author":"Jarboui","year":"2024","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107567_b23","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1051\/ro\/2017044","article-title":"Strongly fully polynomial time approximation scheme for the weighted completion time minimization problem on two-parallel capacitated machines","volume":"51","author":"Kacem","year":"2017","journal-title":"RAIRO-Oper. Res."},{"key":"10.1016\/j.cor.2026.107567_b24","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejco.2022.100030","article-title":"Chance-constrained optimization under limited distributional information: A review of reformulations based on sampling and distributional robustness","volume":"10","author":"K\u00fc\u00e7\u00fckyavuz","year":"2022","journal-title":"EURO J. Comput. Optim."},{"issue":"8","key":"10.1016\/j.cor.2026.107567_b25","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1016\/j.ifacol.2015.09.124","article-title":"Chance constrained planning and scheduling under uncertainty using robust optimization approximation","volume":"48","author":"Li","year":"2015","journal-title":"IFAC-PapersOnLine"},{"issue":"1","key":"10.1016\/j.cor.2026.107567_b26","doi-asserted-by":"crossref","first-page":"7303","DOI":"10.1038\/s41598-022-10891-9","article-title":"Optimization of a molten iron scheduling problem with uncertain processing time using variable neighborhood search algorithm","volume":"12","author":"Liu","year":"2022","journal-title":"Sci. Rep."},{"issue":"2","key":"10.1016\/j.cor.2026.107567_b27","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1137\/070702928","article-title":"A sample approximation approach for optimization with probabilistic constraints","volume":"19","author":"Luedtke","year":"2008","journal-title":"SIAM J. Optim."},{"issue":"6","key":"10.1016\/j.cor.2026.107567_b28","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1287\/opre.13.6.930","article-title":"Chance constrained programming with joint constraints","volume":"13","author":"Miller","year":"1965","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107567_b29","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1016\/j.ejor.2014.04.019","article-title":"Distribution-free vessel deployment for liner shipping","volume":"238","author":"Ng","year":"2014","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107567_b30","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1109\/TASE.2020.2995078","article-title":"An approximation algorithm for unrelated parallel machine scheduling under TOU electricity tariffs","volume":"18","author":"Pei","year":"2020","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.cor.2026.107567_b31","doi-asserted-by":"crossref","DOI":"10.7717\/peerj-cs.844","article-title":"A mathematical formulation and an NSGA-II algorithm for minimizing the makespan and energy cost under time-of-use electricity price in an unrelated parallel machine scheduling","volume":"8","author":"Rego","year":"2022","journal-title":"PeerJ Comput. Sci."},{"issue":"9","key":"10.1016\/j.cor.2026.107567_b32","first-page":"1345","article-title":"Bi-criteria parallel batch machine scheduling to minimize total weighted tardiness and electricity cost","volume":"90","author":"Rocholl","year":"2020","journal-title":"J. Bus. Econ."},{"key":"10.1016\/j.cor.2026.107567_b33","doi-asserted-by":"crossref","DOI":"10.1016\/j.jclepro.2019.119393","article-title":"Energy-efficient scheduling in an unrelated parallel-machine environment under time-of-use electricity tariffs","volume":"249","author":"Saberi-Aliabad","year":"2020","journal-title":"J. Clean. Prod."},{"issue":"4","key":"10.1016\/j.cor.2026.107567_b34","first-page":"123","article-title":"Optimizing electricity costs during integrated scheduling of jobs and stochastic preventive maintenance under time-of-use electricity tariffs","volume":"10","author":"Sadiqi","year":"2019","journal-title":"Manag. Prod. Eng. Rev."},{"key":"10.1016\/j.cor.2026.107567_b35","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejco.2022.100052","article-title":"Unrelated parallel machine energy-efficient scheduling considering sequence-dependent setup times and time-of-use electricity tariffs","volume":"11","author":"Sanati","year":"2023","journal-title":"EURO J. Comput. Optim."},{"key":"10.1016\/j.cor.2026.107567_b36","series-title":"2025 International Annual Conference on Complex Systems and Intelligent Science","first-page":"198","article-title":"Identical parallel batch processing machine scheduling problem with time-of-use electricity tariffs","author":"Seid","year":"2025"},{"key":"10.1016\/j.cor.2026.107567_b37","doi-asserted-by":"crossref","first-page":"1631","DOI":"10.1109\/TASE.2024.3368617","article-title":"Scheduling unrelated parallel batch processing machines under time-of-use electricity prices","volume":"22","author":"Tian","year":"2024","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"2","key":"10.1016\/j.cor.2026.107567_b38","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/nav.20393","article-title":"Scheduling with variable time slot costs","volume":"57","author":"Wan","year":"2010","journal-title":"Naval Res. Logist."},{"key":"10.1016\/j.cor.2026.107567_b39","doi-asserted-by":"crossref","first-page":"7679","DOI":"10.1109\/TASE.2024.3468448","article-title":"Bi-objective optimization of a novel flow shop scheduling problem under time-of-use tariffs","volume":"22","author":"Wang","year":"2025","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.cor.2026.107567_b40","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/j.jclepro.2018.05.056","article-title":"Bi-objective identical parallel machine scheduling to minimize total energy consumption and makespan","volume":"193","author":"Wang","year":"2018","journal-title":"J. Clean. Prod."},{"issue":"6","key":"10.1016\/j.cor.2026.107567_b41","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","article-title":"Individual comparisons by ranking methods","volume":"1","author":"Wilcoxon","year":"1945","journal-title":"Biom. Bull."},{"issue":"1","key":"10.1016\/j.cor.2026.107567_b42","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10107-019-01442-8","article-title":"Optimized Bonferroni approximations of distributionally robust joint chance constraints","volume":"191","author":"Xie","year":"2022","journal-title":"Math. Program."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001851?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001851?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T11:37:09Z","timestamp":1784893029000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001851"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":42,"alternative-id":["S0305054826001851"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107567","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A stochastic bi-objective unrelated parallel machine scheduling under time-of-use tariffs","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107567","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107567"}}