{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T06:21:17Z","timestamp":1778739677822,"version":"3.51.4"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100007834","name":"Natural Science Foundation of Ningbo Municipality","doi-asserted-by":"publisher","award":["2024J195"],"award-info":[{"award-number":["2024J195"]}],"id":[{"id":"10.13039\/100007834","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004387","name":"Ningbo University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004387","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12431702"],"award-info":[{"award-number":["12431702"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Industrial Engineering"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1016\/j.cie.2025.111695","type":"journal-article","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T17:27:23Z","timestamp":1763746043000},"page":"111695","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Single two-stage openshop and parallel two-stage openshops scheduling with optional job rejection under makespan constraint"],"prefix":"10.1016","volume":"212","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-5471-9819","authenticated-orcid":false,"given":"Yanjie","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0335-3253","authenticated-orcid":false,"given":"Wenchang","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9704-9868","authenticated-orcid":false,"given":"Dehua","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.cie.2025.111695_b1","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/j.ejor.2021.03.026","article-title":"Four decades of research on the open-shop scheduling problem to minimize the makespan","volume":"295","author":"Ahmadian","year":"2021","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.cie.2025.111695_b2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10951-022-00745-7","article-title":"Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection","volume":"26","author":"Atsmony","year":"2023","journal-title":"Journal of Scheduling"},{"issue":"1","key":"10.1016\/j.cie.2025.111695_b3","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1137\/S0895480196300522","article-title":"Multiprocessor scheduling with rejection","volume":"13","author":"Bartal","year":"2000","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/j.cie.2025.111695_b4","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.tcs.2022.04.004","article-title":"Scheduling multiple two-stage flowshops with a deadline","volume":"921","author":"Chen","year":"2022","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"10.1016\/j.cie.2025.111695_b5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.mcm.2004.12.016","article-title":"Scheduling a two-stage flowshop under makespan constraint","volume":"44","author":"Dawande","year":"2006","journal-title":"Mathematical and Computer Modelling"},{"key":"10.1016\/j.cie.2025.111695_b6","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s10951-019-00633-7","article-title":"Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments","volume":"23","author":"Dong","year":"2020","journal-title":"Journal of Scheduling"},{"key":"10.1016\/j.cie.2025.111695_b7","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1007\/s10878-018-0314-6","article-title":"A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops","volume":"37","author":"Dong","year":"2019","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"10.1016\/j.cie.2025.111695_b8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0196-6774(03)00078-6","article-title":"Techniques for scheduling with rejection","volume":"49","author":"Engels","year":"2003","journal-title":"Journal of Algorithms"},{"issue":"10","key":"10.1016\/j.cie.2025.111695_b9","doi-asserted-by":"crossref","first-page":"3395","DOI":"10.1109\/TEM.2021.3095954","article-title":"Bi-objective modeling and optimization for stochastic two-stage open shop scheduling problems in the sharing economy","volume":"70","author":"Fu","year":"2023","journal-title":"IEEE Transactions on Engineering Management"},{"issue":"4","key":"10.1016\/j.cie.2025.111695_b10","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":"Journal of the ACM"},{"issue":"3","key":"10.1016\/j.cie.2025.111695_b11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.9790\/5728-0330106","article-title":"Optimal two stage open shop specially structured scheduling to minimize the rental cost, processing time associated with probabilities including transportation time","volume":"3","author":"Gupta","year":"2012","journal-title":"IOSR Journal of Mathematics"},{"key":"10.1016\/j.cie.2025.111695_b12","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10107-002-0324-z","article-title":"Preemptive scheduling with rejection","volume":"94","author":"Hoogeveen","year":"2003","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.cie.2025.111695_b13","volume":"vol. 46","author":"Lau","year":"2011"},{"key":"10.1016\/j.cie.2025.111695_b14","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108168","article-title":"Single-machine scheduling with total late work and job rejection","volume":"169","author":"Mor","year":"2022","journal-title":"Computers & Industrial Engineering"},{"issue":"6","key":"10.1016\/j.cie.2025.111695_b15","doi-asserted-by":"crossref","first-page":"2083","DOI":"10.1080\/00207543.2023.2217277","article-title":"A common due-date assignment problem with job rejection on parallel uniform machines","volume":"62","author":"Mosheiov","year":"2024","journal-title":"International Journal of Production Research"},{"issue":"1","key":"10.1016\/j.cie.2025.111695_b16","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.25.1.45","article-title":"A survey of scheduling rules","volume":"25","author":"Panwalkar","year":"1977","journal-title":"Operations Research"},{"issue":"1\u20132","key":"10.1016\/j.cie.2025.111695_b17","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0377-0427(00)00433-7","article-title":"Interior-point methods","volume":"124","author":"Potra","year":"2000","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"10.1016\/j.cie.2025.111695_b18","doi-asserted-by":"crossref","first-page":"5099","DOI":"10.1007\/s00500-018-3177-y","article-title":"Extended genetic algorithm for solving open-shop scheduling problem","volume":"23","author":"Rahmani Hosseinabadi","year":"2019","journal-title":"Soft Computing"},{"issue":"1","key":"10.1016\/j.cie.2025.111695_b19","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/nav.3800220110","article-title":"The knapsack problem: a survey","volume":"22","author":"Salkin","year":"1975","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/j.cie.2025.111695_b20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","article-title":"A survey on offline scheduling with rejection","volume":"16","author":"Shabtay","year":"2013","journal-title":"Journal of Scheduling"},{"key":"10.1016\/j.cie.2025.111695_b21","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/j.tcs.2022.04.044","article-title":"A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint","volume":"922","author":"Tong","year":"2022","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.cie.2025.111695_b22","series-title":"A course in combinatorics","author":"Van Lint","year":"2001"},{"key":"10.1016\/j.cie.2025.111695_b23","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/s00291-015-0409-8","article-title":"Two-machine open-shop scheduling with rejection to minimize the makespan","volume":"38","author":"Zhang","year":"2016","journal-title":"OR Spectrum"},{"key":"10.1016\/j.cie.2025.111695_b24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2017.05.033","article-title":"Parallel machine scheduling with restricted job rejection","volume":"690","author":"Zhong","year":"2017","journal-title":"Theoretical Computer Science"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835225008411?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835225008411?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T06:35:09Z","timestamp":1773815709000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835225008411"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":24,"alternative-id":["S0360835225008411"],"URL":"https:\/\/doi.org\/10.1016\/j.cie.2025.111695","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2026,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Single two-stage openshop and parallel two-stage openshops scheduling with optional job rejection under makespan constraint","name":"articletitle","label":"Article Title"},{"value":"Computers & Industrial Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cie.2025.111695","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"111695"}}