{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,12]],"date-time":"2023-02-12T01:50:17Z","timestamp":1676166617502},"reference-count":23,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1016\/0305-0548(93)90058-q","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"707-722","source":"Crossref","is-referenced-by-count":26,"title":["On the heuristic solution of the permutation flow shop problem by path algorithms"],"prefix":"10.1016","volume":"20","author":[{"given":"Frank","family":"Werner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(93)90058-Q_BIB1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production scheduling with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(93)90058-Q_BIB2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1051\/ro\/1983170201051","article-title":"A concise survey of efficiently solvable special cases of the permutation flow shop problem","volume":"17","author":"Monma","year":"1983","journal-title":"RAIRO Rech. Oper."},{"key":"10.1016\/0305-0548(93)90058-Q_BIB3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/opre.26.1.53","article-title":"A general bounding scheme for the permutation flow shop problem","volume":"28","author":"Lageweg","year":"1978","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(93)90058-Q_BIB4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0377-2217(85)90317-0","article-title":"Decomposition approaches in permutation scheduling problems with application to the m-machine flow shop scheduling problems","volume":"19","author":"Shanthikumar","year":"1985","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(93)90058-Q_BIB5","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1287\/mnsc.16.10.B630","article-title":"A Heuristic algorithm for the n-job, m-machine sequencing problem","volume":"16","author":"Campbell","year":"1970","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(93)90058-Q_BIB6","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1287\/mnsc.23.12.1273","article-title":"An evaluation of flow shop sequencing heuristics","volume":"23","author":"Dannenbring","year":"1977","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(93)90058-Q_BIB7","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m-machine, n-job flow shop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"OMEGA"},{"key":"10.1016\/0305-0548(93)90058-Q_BIB8","first-page":"48","article-title":"Zu einigen Nachbarschaftsgraphen f\u00fcr die Entwicklung geeigneter Iterationsverfahren zur n\u00e4herungsweisen L\u00f6sung eines speziellen Permutationsproblems, Wiss.","volume":"31","author":"Werner","year":"1987","journal-title":"Zeitsch. TU Magd."},{"key":"10.1016\/0305-0548(93)90058-Q_BIB9","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1080\/02331938808843374","article-title":"Zu einigen Nachbarschaftsstrukturen f\u00fcr Iterationsverfahren zur n\u00e4herungsweisen L\u00f6sung spezieller Reihenfolgeprobleme","volume":"19","author":"Werner","year":"1988","journal-title":"Optimization"},{"key":"10.1016\/0305-0548(93)90058-Q_BIB10","article-title":"Zur Struktur und n\u00e4herungsweisen L\u00f6sung ausgew\u00e4hlter kombinatorischer Optimierungsprobleme","author":"Werner","year":"1989"},{"key":"10.1016\/0305-0548(93)90058-Q_BIB11","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1287\/opre.22.3.629","article-title":"Heuristic programming solution of a flowshop scheduling problem","volume":"22","author":"Krone","year":"1974","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(93)90058-Q_BIB12","first-page":"50","article-title":"Ein adaptives stochastisches Suchverfahren f\u00fcr spezielle Reihenfolgeprobleme","volume":"24","author":"Werner","year":"1988","journal-title":"Ekonom.-Matemat. Obzor."},{"key":"10.1016\/0305-0548(93)90058-Q_BIB13","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing: an experimental evaluation I: graph partitioning","volume":"37","author":"Johnson","year":"1989","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(93)90058-Q_BIB14","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search\u2014Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0305-0548(93)90058-Q_BIB15","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search\u2014Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0305-0548(93)90058-Q_BIB16","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","article-title":"A new heuristic method for the flow shop sequencing problems","volume":"41","author":"Widmer","year":"1989","journal-title":"Eur. J. Opl. Res."},{"key":"10.1016\/0305-0548(93)90058-Q_BIB17","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(86)90191-8","article-title":"A block approach for single machine scheduling with release dates and due dates","volume":"26","author":"Grabowski","year":"1986","journal-title":"Europ. J. Opl Res."},{"key":"10.1016\/0305-0548(93)90058-Q_BIB18","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF01417515","article-title":"On the combinatorial structure of the permutation flow shop problem","volume":"35","author":"Werner","year":"1991","journal-title":"ZOR\u2014Meth. Models Ops Res."},{"key":"10.1016\/0305-0548(93)90058-Q_BIB19","article-title":"Benchmarks for Basic Scheduling Problems","author":"Taillard","year":"1989","journal-title":"ORWP 89\/21"},{"key":"10.1016\/0305-0548(93)90058-Q_BIB20","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","article-title":"Simulated annealing for permutation flow shop scheduling","volume":"17","author":"Osman","year":"1989","journal-title":"OMEGA"},{"key":"10.1016\/0305-0548(93)90058-Q_BIB21","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1080\/00207548408942436","article-title":"A survey and evaluation of static flowshop scheduling heuristics","volume":"22","author":"Park","year":"1984","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/0305-0548(93)90058-Q_BIB22","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0305-0483(87)90054-5","article-title":"Comparison of heuristics for flow shop sequencing","volume":"15","author":"Turner","year":"1987","journal-title":"OMEGA"},{"key":"10.1016\/0305-0548(93)90058-Q_BIB23","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1080\/02331939108843670","article-title":"Some relations between neighbourhood graphs for a permutation problem","volume":"22","author":"Werner","year":"1991","journal-title":"Optimization"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489390058Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489390058Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:25:32Z","timestamp":1552929932000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489390058Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":23,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["030505489390058Q"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(93)90058-q","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}