{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:29:07Z","timestamp":1759847347509},"reference-count":23,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3735,"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":[[2003,6]]},"DOI":"10.1016\/s0166-218x(02)00502-4","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"395-419","source":"Crossref","is-referenced-by-count":13,"title":["A lower bound for the job insertion problem"],"prefix":"10.1016","volume":"128","author":[{"given":"Tam\u00e1s","family":"Kis","sequence":"first","affiliation":[]},{"given":"Alain","family":"Hertz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0166-218X(02)00502-4_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\/S0166-218X(02)00502-4_BIB2","series-title":"Network Flows","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0166-218X(02)00502-4_BIB3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","article-title":"A computational study of the job-shop scheduling instance","volume":"3","author":"Applegate","year":"1991","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0166-218X(02)00502-4_BIB4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0377-2217(99)00496-8","article-title":"A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes","volume":"127","author":"Artigues","year":"2000","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/S0166-218X(02)00502-4_BIB5","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/mnsc.41.1.94","article-title":"The one-machine problem with delayed precedence constraints and its use in job shop scheduling","volume":"41","author":"Balas","year":"1995","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(02)00502-4_BIB6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01545525","article-title":"Tabu-search for the multi-mode job-shop problem","volume":"20","author":"Brucker","year":"1998","journal-title":"OR Spektrum"},{"key":"10.1016\/S0166-218X(02)00502-4_BIB7","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","article-title":"On certain polytopes associated with graphs","volume":"18","author":"Chv\u00e1tal","year":"1975","journal-title":"J. Combinat. Theory B"},{"key":"10.1016\/S0166-218X(02)00502-4_BIB8","series-title":"Computer and Job-Shop Scheduling Theory","author":"Coffman","year":"1976"},{"key":"10.1016\/S0166-218X(02)00502-4_BIB9","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1018930406487","article-title":"An integrated approach for modelling and solving the general multiprocessor job-shop scheduling problem using tabu search","volume":"70","author":"Dauz\u00e8re-P\u00e9res","year":"1997","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(02)00502-4_BIB10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0377-2217(97)00341-X","article-title":"Multi-resource shop scheduling with resource flexibility","volume":"107","author":"Dauz\u00e8re-P\u00e9res","year":"1998","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(02)00502-4_BIB11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","article-title":"Applying tabu search to the job-shop scheduling problem","volume":"41","author":"Dell\u2019 Amico","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(02)00502-4_BIB12","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(02)00502-4_BIB13","unstructured":"A.S. Jain, S. Meeran, A state-of-the-art review of job-shop scheduling techniques., Technical Report, Department of Applied Physics, Electronic and Mechanical Engineering, University of Dundee, Dundee, Scotland, 1998."},{"key":"10.1016\/S0166-218X(02)00502-4_BIB14","unstructured":"T. Kis, Insertion techniques for job shop scheduling, Ph.D. Thesis, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland, 2001."},{"key":"10.1016\/S0166-218X(02)00502-4_BIB15","series-title":"Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques, Supplement, Graduate School of Industrial Administration","author":"Lawrence","year":"1984"},{"key":"10.1016\/S0166-218X(02)00502-4_BIB16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","article-title":"Effective neighbourhood function for the flexible job shop problem","volume":"3","author":"Mastrolilli","year":"2000","journal-title":"J. Schedul."},{"issue":"6","key":"10.1016\/S0166-218X(02)00502-4_BIB17","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","article-title":"A fast taboo search algorithm for the job-shop problem","volume":"42","author":"Nowicki","year":"1996","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(02)00502-4_BIB18","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0166-218X(02)00502-4_BIB19","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/0377-2217(91)90066-5","article-title":"The complexity of shop-scheduling problems with two or three jobs","volume":"53","author":"Sotskov","year":"1991","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/S0166-218X(02)00502-4_BIB20","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1051\/ro:1999110","article-title":"On the application of insertion techniques for job shop problems with setup times","volume":"33","author":"Sotskov","year":"1999","journal-title":"RAIRO Rech. Op\u00e9r."},{"key":"10.1016\/S0166-218X(02)00502-4_BIB21","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","article-title":"New search spaces for sequencing instances with application to job shop scheduling","volume":"38","author":"Storer","year":"1992","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(02)00502-4_BIB22","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1287\/ijoc.8.3.302","article-title":"Job shop scheduling by local search","volume":"8","author":"Vaessens","year":"1996","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/S0166-218X(02)00502-4_BIB23","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0166-218X(93)E0127-K","article-title":"Insertion techniques for the heuristic solution of the job shop problem","volume":"58","author":"Werner","year":"1995","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005024?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005024?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T22:52:59Z","timestamp":1553381579000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02005024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":23,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0166218X02005024"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00502-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}