{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:50:11Z","timestamp":1649015411063},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1016\/j.ejor.2018.01.049","type":"journal-article","created":{"date-parts":[[2018,2,3]],"date-time":"2018-02-03T03:59:23Z","timestamp":1517630363000},"page":"463-472","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Unit-capacity Constrained Permutation Problem"],"prefix":"10.1016","volume":"268","author":[{"given":"Pascale","family":"Bendotti","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Fouilhoux","sequence":"additional","affiliation":[]},{"given":"Safia","family":"Kedad-Sidhoum","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2018.01.049_bib0001","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","article-title":"A survey of scheduling problems with setup times or costs","volume":"187","author":"Allahverdi","year":"2008","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2018.01.049_bib0002","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/net.20451","article-title":"The preemptive swapping problem on a tree","volume":"58","author":"Anily","year":"2011","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2018.01.049_bib0003","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1002\/net.3230220408","article-title":"The swapping problems","volume":"22","author":"Anily","year":"1992","journal-title":"Networks"},{"issue":"A","key":"10.1016\/j.ejor.2018.01.049_bib0006","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.disopt.2015.09.004","article-title":"Feasibility recovery for the unit-capacity constrained permutation problem","volume":"22","author":"Bendotti","year":"2016","journal-title":"Discrete Optimization"},{"key":"10.1016\/j.ejor.2018.01.049_bib0007","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1002\/nav.20361","article-title":"A branch and cut algorithm for the non-preemptive swapping problem","volume":"56","author":"Bordenave","year":"2009","journal-title":"Naval Research Logistics"},{"issue":"4","key":"10.1016\/j.ejor.2018.01.049_bib0008","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1002\/net.20447","article-title":"A branch and cut algorithm for the preemptive swapping problem","volume":"59","author":"Bordenave","year":"2012","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2018.01.049_bib0009","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0377-2217(96)00388-8","article-title":"Combinatorial optimization models for production scheduling in automated manufacturing systems","volume":"99","author":"Crama","year":"1997","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"10.1016\/j.ejor.2018.01.049_bib0010","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1016\/S0167-8191(00)00034-X","article-title":"On the complexity of loop fusion","volume":"26","author":"Darte","year":"2000","journal-title":"Parallel Computing"},{"key":"10.1016\/j.ejor.2018.01.049_bib0011","doi-asserted-by":"crossref","first-page":"1599","DOI":"10.1016\/j.dam.2010.05.025","article-title":"A branch-and-cut algorithm for solving the non-preemptive capacitated problem","volume":"158","author":"Erdog\u0103n","year":"2010","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2018.01.049_bib0012","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.tcs.2012.05.032","article-title":"An algorithmic analysis of the honey-bee game","volume":"452","author":"Fleischer","year":"2012","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.ejor.2018.01.049_bib0013","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"issue":"9","key":"10.1016\/j.ejor.2018.01.049_bib0014","doi-asserted-by":"crossref","first-page":"2908","DOI":"10.1016\/j.cor.2007.01.007","article-title":"The single vehicle routing problem with deliveries and selective pickups","volume":"35","author":"Gribkovskaia","year":"2008","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2018.01.049_bib0015","unstructured":"Guigou, J., & Mauget, A. (1987). Notice d\u2019utilisation du logiciel MAC1. Technical report EDF HI\/23-5769."},{"key":"10.1016\/j.ejor.2018.01.049_bib0016","unstructured":"Lagoutte, A., & Tavenas, S. (2015). The complexity of shortest common supersequence for inputs with no identical consecutive letters. http:\/\/arxiv.org\/abs\/1309.0422."},{"issue":"2","key":"10.1016\/j.ejor.2018.01.049_bib0017","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","article-title":"The complexity of some problems on subsequences and supersequences","volume":"25","author":"Maier","year":"1978","journal-title":"Journal of the Ass. for Computing Machinery"},{"key":"10.1016\/j.ejor.2018.01.049_bib0018","unstructured":"Mauget, A. (1987). Notice technique de MAC1. Technical report EDF HI\/23-5755."},{"issue":"6","key":"10.1016\/j.ejor.2018.01.049_bib0019","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1287\/opre.28.6.1347","article-title":"A dynamic programming approach for sequencing groups of identical jobs","volume":"28","author":"Psaraftis","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2018.01.049_bib0020","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(81)90075-X","article-title":"The shortest common supersequence problem over binary alphabet is NP-complete","volume":"16","author":"R\u00e4ih\u00e4","year":"1981","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"10.1016\/j.ejor.2018.01.049_bib0021","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","article-title":"The general pickup and delivery problem","volume":"29","author":"Savelsbergh","year":"1995","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2018.01.049_bib0022","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1016\/0305-0548(96)00016-0","article-title":"Low-complexity algorithms for sequencing jobs with a fixed number of job-classes","volume":"23","author":"Van der Veen","year":"1996","journal-title":"Computers & Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221718300857?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221718300857?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T15:27:29Z","timestamp":1605281249000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221718300857"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["S0377221718300857"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2018.01.049","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2018,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The Unit-capacity Constrained Permutation Problem","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2018.01.049","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}