{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:53:30Z","timestamp":1743087210148,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":27,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_313","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:00:15Z","timestamp":1219662015000},"page":"1782-1788","source":"Crossref","is-referenced-by-count":3,"title":["Job-shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"313_CR1_313","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J. Adams","year":"1988","unstructured":"Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Managem Sci 34:391\u2013401","journal-title":"Managem. Sci."},{"key":"313_CR2_313","first-page":"429","volume":"3","author":"S.B. Akers","year":"1955","unstructured":"Akers SB, Friedman J (1955) A\u00a0non-numerical approach to production scheduling problems. Oper Res 3:429\u2013442","journal-title":"Oper. Res."},{"key":"313_CR3_313","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"Applegate D, Cook W (1991) A\u00a0computational study of the job-shop scheduling problem. ORSA J Comput 3:149\u2013156","journal-title":"ORSA J. Comput."},{"key":"313_CR4_313","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/mnsc.41.1.94","volume":"41","author":"E. Balas","year":"1995","unstructured":"Balas E, Lenstra JK, Vazacopoulos A (1995) One machine scheduling with delayed precedence constraints. Managem Sci 41:94\u20131096","journal-title":"Managem. Sci."},{"key":"313_CR5_313","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/00207548208947745","volume":"20","author":"J.H. Blackstone","year":"1982","unstructured":"Blackstone JH, Phillips DT, Hogg GL (1982) A\u00a0state of art survey of dispatching rules for manufacturing. Internat J Production Res 20:27\u201345","journal-title":"Internat. J. Production Res."},{"key":"313_CR6_313","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/1099-1425(200101\/02)4:1<53::AID-JOS59>3.0.CO;2-Y","volume":"4","author":"W. Brinkk\u00f6tter","year":"2001","unstructured":"Brinkk\u00f6tter W, Brucker P (2001) Solving open benchmark instances for the jobshop problem by parallel head-tail adjustments. J\u00a0Scheduling 4:53\u201364","journal-title":"J. Scheduling"},{"key":"313_CR7_313","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF02276919","volume":"40","author":"P. Brucker","year":"1988","unstructured":"Brucker P (1988) An efficient algorithm for the job-shop problem with two jobs. Computing 40:353\u2013359","journal-title":"Computing"},{"key":"313_CR8_313","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01719698","volume":"16","author":"P. Brucker","year":"1994","unstructured":"Brucker P (1994) A\u00a0polynomial algorithm for the two machine job-shop scheduling problem with fixed number of jobs. Oper Res Spektrum 16:5\u20137","journal-title":"Oper. Res. Spektrum"},{"key":"313_CR9_313","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03612-9","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"1998","unstructured":"Brucker P (1998) Scheduling algorithms, 2nd edn. Springer, Berlin"},{"key":"313_CR10_313","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0377-2217(93)90174-L","volume":"64","author":"P. Brucker","year":"1993","unstructured":"Brucker P, Jurisch B (1993) A\u00a0new lower bound for the job-shop scheduling problem. Europ J Oper Res 64:156\u2013167","journal-title":"Europ. J. Oper. Res."},{"key":"313_CR11_313","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","volume":"49","author":"P. Brucker","year":"1994","unstructured":"Brucker P, Jurisch B, Sievers B (1994) A\u00a0branch and bound algorithm for the job-shop problem. Discrete Appl Math 49:107\u2013127","journal-title":"Discrete Appl. Math."},{"key":"313_CR12_313","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/PL00020906","volume":"49","author":"P. Brucker","year":"1999","unstructured":"Brucker P, Kravchenko SA, Sotskov YN (1999) Preemptive job-shop scheduling problems with a\u00a0fixed number of jobs. Math Meth Oper Res 49:41\u201376","journal-title":"Math. Meth. Oper. Res."},{"key":"313_CR13_313","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"Carlier J, Pinson E (1989) An algorithm for solving the job-shop problem. Managem Sci 35:164\u2013176","journal-title":"Managem. Sci."},{"key":"313_CR14_313","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01721162","volume":"11","author":"R. Haupt","year":"1989","unstructured":"Haupt R (1989) A\u00a0survey of priority-rule based scheduling. OR Spektrum 11:3\u201316","journal-title":"OR Spektrum"},{"key":"313_CR15_313","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1287\/moor.7.3.354","volume":"7","author":"N. Hefetz","year":"1982","unstructured":"Hefetz N, Adiri I (1982) An efficient algorithm for the two-machine unit-time jobshop schedule-length problem. Math Oper Res 7:354\u2013360","journal-title":"Math. Oper. Res."},{"key":"313_CR16_313","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/nav.3800030307","volume":"3","author":"J.R. Jackson","year":"1956","unstructured":"Jackson JR (1956) An extension of Johnson's results on job lot scheduling. Naval Res Logist Quart 3:201\u2013203","journal-title":"Naval Res. Logist. Quart."},{"key":"313_CR17_313","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF02099698","volume":"57","author":"W. Kubiak","year":"1995","unstructured":"Kubiak W, Sethi S, Sriskandarajah C (1995) An efficient algorithm for\n\t    a\u00a0job shop problem. Ann Oper Res 57:203\u2013216","journal-title":"Ann. Oper. Res."},{"key":"313_CR18_313","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0167-5060(08)70821-5","volume":"4","author":"J.K. Lenstra","year":"1979","unstructured":"Lenstra JK, Rinnooy Kan AHG (1979) Computational complexity of discrete optimization problems. Ann Discret Math 4:121\u2013140","journal-title":"Ann. Discret Math."},{"key":"313_CR19_313","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J.K. Lenstra","year":"1977","unstructured":"Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343\u2013362","journal-title":"Ann. Discret Math."},{"key":"313_CR20_313","doi-asserted-by":"crossref","unstructured":"Martin PD, Shmoys DB (1996) A\u00a0new approach to computing optimal schedules for the job shop scheduling problem. Proc. 5th Internat. IPCO Conf.","DOI":"10.1007\/3-540-61310-2_29"},{"key":"313_CR21_313","volume-title":"Industrial scheduling","author":"J.F. Muth","year":"1963","unstructured":"Muth JF, Thompson GL (1963) Industrial scheduling. Prentice-Hall, Englewood Cliffs, NJ"},{"key":"313_CR22_313","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C (1996) A\u00a0fast tabu search algorithm for the job shop problem. Managem Sci 42:797\u2013813","journal-title":"Managem. Sci."},{"key":"313_CR23_313","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"S.S. Panwalker","year":"1977","unstructured":"Panwalker SS, Iskander W (1977) A\u00a0survey of scheduling rules. Oper Res 25:45\u201361","journal-title":"Oper. Res."},{"key":"313_CR24_313","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0377-2217(91)90066-5","volume":"53","author":"Y.N. Sotskov","year":"1991","unstructured":"Sotskov YN (1991) On the complexity of shop scheduling problems with two or three jobs. Europ J Oper Res 53:323\u2013336","journal-title":"Europ. J. Oper. Res."},{"key":"313_CR25_313","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0166-218X(93)E0169-Y","volume":"59","author":"Y.N. Sotskov","year":"1995","unstructured":"Sotskov YN, Shakhlevich NV (1995) NP-hardness of shop-scheduling problems with three jobs. Discrete Appl Math 59:237\u2013266","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"313_CR26_313","first-page":"46","volume":"23","author":"V.G. Timkovsky","year":"1985","unstructured":"Timkovsky VG (1985) On the complexity of scheduling an arbitrary\n\t    system. Soviet J Comput Syst Sci 23(5):46\u201352","journal-title":"Soviet J. Comput. Syst. Sci."},{"key":"313_CR27_313","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1287\/ijoc.8.3.302","volume":"8","author":"R.J.M. Vaessens","year":"1996","unstructured":"Vaessens RJM, Aarts EHL, Lenstra JK (1996) Job shop scheduling by local\n\t    search. INFORMS J Comput 8:302\u2013317","journal-title":"INFORMS J. Comput."}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T12:07:05Z","timestamp":1720699625000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_313","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}