{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:56:01Z","timestamp":1780055761492,"version":"3.54.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6713,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1016\/0166-218x(93)e0127-k","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:14:35Z","timestamp":1027649675000},"page":"191-211","source":"Crossref","is-referenced-by-count":60,"title":["Insertion techniques for the heuristic solution of the job shop problem"],"prefix":"10.1016","volume":"58","author":[{"given":"Frank","family":"Werner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Winkler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)E0127-K_BIB1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","article-title":"The shifting bottleneck procedure for job shop scheduling","volume":"34","author":"Adams","year":"1988","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(93)E0127-K_BIB2","article-title":"Lateinische Rechtecke und Maschinenbelegung","volume":"B","author":"Br\u00e4sel","year":"1990"},{"key":"10.1016\/0166-218X(93)E0127-K_BIB3","series-title":"Constructive heuristic algorithms for the open shop problem","author":"Br\u00e4sel","year":"1991"},{"key":"10.1016\/0166-218X(93)E0127-K_BIB4","series-title":"System Modelling and Optimization, Proceedings of the 14th IFIP Conference Leipzig","article-title":"The job-shop problem \u2014 modelling by latin rectangles, exact and heuristic solution","author":"Br\u00e4sel","year":"1989"},{"key":"10.1016\/0166-218X(93)E0127-K_BIB5","series-title":"A fast branch and bound algorithm for the job-shop problem","author":"Brucker","year":"1990"},{"key":"10.1016\/0166-218X(93)E0127-K_BIB6","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the job-shop problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(93)E0127-K_BIB7","doi-asserted-by":"crossref","first-page":"B782","DOI":"10.1287\/mnsc.17.12.B782","article-title":"An implicit enumeration algorithm for the machine sequencing problem","volume":"17","author":"Florian","year":"1971","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(93)E0127-K_BIB8","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search \u2014 part I","volume":"1\/3","author":"Glover","year":"1989","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0166-218X(93)E0127-K_BIB9","series-title":"Operations Research in Progress","first-page":"57","article-title":"A new algorithm of solving the flow-shop problem","author":"Grabowski","year":"1982"},{"key":"10.1016\/0166-218X(93)E0127-K_BIB10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01721162","article-title":"A survey of priority rule-based scheduling","volume":"11","author":"Haupt","year":"1989","journal-title":"OR Spektrum"},{"key":"10.1016\/0166-218X(93)E0127-K_BIB11","series-title":"Simulated Annealing: Theory and Applications","author":"Van Laarhoven","year":"1987"},{"key":"10.1016\/0166-218X(93)E0127-K_BIB12","article-title":"Sequencing and scheduling: algorithms and complexity","author":"Lawler","year":"1989"},{"key":"10.1016\/0166-218X(93)E0127-K_BIB13","series-title":"Industrial Scheduling","author":"Muth","year":"1963"},{"key":"10.1016\/0166-218X(93)E0127-K_BIB14","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\/0166-218X(93)E0127-K_BIB15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/mnsc.35.2.177","article-title":"The single machine early\/tardy problem","volume":"35","author":"Ow","year":"1989","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(93)E0127-K_BIB16","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","article-title":"An analysis of several heuristics for the traveling salesman problem","volume":"6","author":"Rosenkrantz","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)E0127-K_BIB17","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1080\/00207547908919634","article-title":"Job-shop scheduling heuristics with local neighbourhood search","volume":"17","author":"Spachis","year":"1979","journal-title":"Internat. J. Prod. Res."},{"issue":"5","key":"10.1016\/0166-218X(93)E0127-K_BIB18","first-page":"48","article-title":"Zu einigen Nachbarschaftsstrukturen f\u00fcr Iterationsverfahren zur n\u00e4herungsweisen L\u00f6sung spezieller Reihenfolgeprobleme","volume":"31","author":"Werner","year":"1987","journal-title":"Wiss. Z. Tech. Univ. Magdeburg"},{"key":"10.1016\/0166-218X(93)E0127-K_BIB19","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\/0166-218X(93)E0127-K_BIB20","series-title":"Iterative heuristics for the job-shop problem","author":"Werner","year":"1988"},{"key":"10.1016\/0166-218X(93)E0127-K_BIB21","article-title":"Zur Struktur und n\u00e4herungsweisen L\u00f6sung ausgew\u00e4hlter kombinatorischer Optimierungsprobleme","volume":"B","author":"Werner","year":"1989"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93E0127K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93E0127K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T21:54:44Z","timestamp":1555278884000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X93E0127K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["0166218X93E0127K"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)e0127-k","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}