{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T10:30:22Z","timestamp":1781087422426,"version":"3.54.1"},"reference-count":54,"publisher":"Informa UK Limited","issue":"24","funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"crossref","award":["#2021\/11586-2"],"award-info":[{"award-number":["#2021\/11586-2"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Production Research"],"published-print":{"date-parts":[[2023,12,17]]},"DOI":"10.1080\/00207543.2022.2154404","type":"journal-article","created":{"date-parts":[[2022,12,15]],"date-time":"2022-12-15T10:25:02Z","timestamp":1671099902000},"page":"8560-8579","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":5,"title":["A new two-stage constraint programming approach for open shop scheduling problem with machine blocking"],"prefix":"10.1080","volume":"61","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3773-9787","authenticated-orcid":false,"given":"Levi R.","family":"Abreu","sequence":"first","affiliation":[{"name":"Department of Production Engineering, University of S\u00e3o Paulo, S\u00e3o Carlos, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0239-1725","authenticated-orcid":false,"given":"Marcelo S.","family":"Nagano","sequence":"additional","affiliation":[{"name":"Department of Production Engineering, University of S\u00e3o Paulo, S\u00e3o Carlos, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3920-089X","authenticated-orcid":false,"given":"Bruno A.","family":"Prata","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, Federal University of Cear\u00e1, Fortaleza, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2022,12,15]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104793"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108128"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105744"},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104373"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.03.026"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-011-3825-1"},{"issue":"1","key":"e_1_3_3_8_1","first-page":"177","article-title":"Scheduling to Minimize Makespan on Unrelated Parallel Machines with Sequence Dependent Setup Times","volume":"17","author":"Al-Salem A.","year":"2004","unstructured":"Al-Salem, A., et\u00a0al. 2004. \u201cScheduling to Minimize Makespan on Unrelated Parallel Machines with Sequence Dependent Setup Times.\u201d Engineering Journal of the University of Qatar 17 (1): 177\u2013187.","journal-title":"Engineering Journal of the University of Qatar"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511615320"},{"key":"e_1_3_3_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2016.1164854"},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-014-0890-y"},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(96)00116-3"},{"key":"e_1_3_3_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-019-03871-1"},{"key":"e_1_3_3_14_1","first-page":"1","article-title":"A New Variable Neighbourhood Search with a Constraint Programming Search Strategy for the Open Shop Scheduling Problem with Operation Repetitions","volume":"50","author":"de Abreu Levi Ribeiro","year":"2021","unstructured":"Levi Ribeiro de Abreu, Kennedy A. Guimar\u00e3es Ara\u00fajo, Bruno de Athayde Prata, Marcelo Seido Nagano, and Jo\u00e3o Vitor Moccellin. 2021. \u201cA New Variable Neighbourhood Search with a Constraint Programming Search Strategy for the Open Shop Scheduling Problem with Operation Repetitions.\u201d Engineering Optimization 50: 1\u201320.","journal-title":"Engineering Optimization"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.1108\/JM2-11-2020-0302"},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2018.05.014"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/321978.321985"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00332-9"},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018930613891"},{"key":"e_1_3_3_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.44.3.510"},{"key":"e_1_3_3_21_1","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105616","article-title":"Metaheuristics with Restart and Learning Mechanisms for the No-idle Flowshop Scheduling Problem with Makespan Criterion","volume":"138","author":"Hande \u00d6ztop","year":"2021","unstructured":"Hande, \u00d6ztop, M. Fatih Tasgetiren, Levent Kandiller, and Quan-Ke Pan. 2021. \u201cMetaheuristics with Restart and Learning Mechanisms for the No-idle Flowshop Scheduling Problem with Makespan Criterion.\u201d Computers & Operations Research 138105616.","journal-title":"Computers & Operations Research"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2007.10.003"},{"key":"e_1_3_3_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.11.011"},{"key":"e_1_3_3_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2019.02.005"},{"key":"e_1_3_3_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-009-0318-2"},{"key":"e_1_3_3_26_1","doi-asserted-by":"crossref","unstructured":"Laborie Philippe. 2018. \u201cAn Update on the Comparison of MIP CP and Hybrid Approaches for Mixed Resource Allocation and Scheduling.\u201d In International Conference on the Integration of Constraint Programming Artificial Intelligence and Operations Research 403\u2013411. Springer.","DOI":"10.1007\/978-3-319-93031-2_29"},{"key":"e_1_3_3_27_1","unstructured":"Laborie Philippe and Daniel Godard. 2007. \u201cSelf-adapting Large Neighborhood Search: Application to Single-Mode Scheduling Problems.\u201d Proceedings MISTA-07 Paris 8."},{"key":"e_1_3_3_28_1","doi-asserted-by":"publisher","DOI":"10.3390\/a12110242"},{"key":"e_1_3_3_29_1","doi-asserted-by":"crossref","unstructured":"LaTorre Antonio Daniel Molina Eneko Osaba Javier Del Ser and Francisco Herrera. 2020. \u201c\u201cFairness in Bio-inspired Optimization Research: A Prescription of Methodological Guidelines for Comparing Meta-Heuristics.\u201d arXiv preprint arXiv:2004.09969.","DOI":"10.1016\/j.swevo.2021.100973"},{"issue":"12","key":"e_1_3_3_30_1","first-page":"1972","article-title":"Optimal Planning of Parts' Machining on a Number of Machines","volume":"12","author":"Levner E. V.","year":"1969","unstructured":"Levner, E. V. 1969. \u201cOptimal Planning of Parts' Machining on a Number of Machines.\u201d Automatin and Remote Control 12 (12): 1972\u20131978.","journal-title":"Automatin and Remote Control"},{"key":"e_1_3_3_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2007.01.005"},{"key":"e_1_3_3_32_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1100.0446"},{"key":"e_1_3_3_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00338-1"},{"key":"e_1_3_3_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2017.2707494"},{"key":"e_1_3_3_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.02.010"},{"key":"e_1_3_3_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106347"},{"key":"e_1_3_3_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.06.069"},{"key":"e_1_3_3_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s40430-018-0980-4"},{"key":"e_1_3_3_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.02.051"},{"key":"e_1_3_3_40_1","volume-title":"Design and Analysis of Experiments","author":"Montgomery Douglas C.","year":"2017","unstructured":"Montgomery, Douglas C. 2017. Design and Analysis of Experiments. New York: John Wiley & Sons."},{"key":"e_1_3_3_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.04.010"},{"key":"e_1_3_3_42_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2010.497174"},{"key":"e_1_3_3_43_1","doi-asserted-by":"publisher","DOI":"10.1186\/2251-712X-8-29"},{"key":"e_1_3_3_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2014.06.011"},{"key":"e_1_3_3_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-013-0850-y"},{"key":"e_1_3_3_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3"},{"key":"e_1_3_3_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3177-y"},{"key":"e_1_3_3_48_1","volume-title":"Handbook of Constraint Programming","author":"Rossi Francesca","year":"2006","unstructured":"Rossi, Francesca, Peter Van Beek, and Toby Walsh. 2006. Handbook of Constraint Programming. New York: Elsevier."},{"key":"e_1_3_3_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2019.119393"},{"key":"e_1_3_3_50_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6750(199903)46:2<129::AID-NAV1>3.0.CO;2-3"},{"key":"e_1_3_3_51_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601805"},{"key":"e_1_3_3_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"e_1_3_3_53_1","doi-asserted-by":"publisher","DOI":"10.1080\/10170669.2000.10432874"},{"key":"e_1_3_3_54_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2021.1885068"},{"key":"e_1_3_3_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-013-0860-9"}],"container-title":["International Journal of Production Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207543.2022.2154404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T08:27:56Z","timestamp":1699345676000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207543.2022.2154404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,15]]},"references-count":54,"journal-issue":{"issue":"24","published-print":{"date-parts":[[2023,12,17]]}},"alternative-id":["10.1080\/00207543.2022.2154404"],"URL":"https:\/\/doi.org\/10.1080\/00207543.2022.2154404","relation":{},"ISSN":["0020-7543","1366-588X"],"issn-type":[{"value":"0020-7543","type":"print"},{"value":"1366-588X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,15]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2022-02-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-09-13","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-12-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}