{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T20:24:31Z","timestamp":1648671871320},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[1995,4]]},"DOI":"10.1007\/bf00123683","type":"journal-article","created":{"date-parts":[[2004,10,31]],"date-time":"2004-10-31T05:43:15Z","timestamp":1099201395000},"page":"117-122","source":"Crossref","is-referenced-by-count":2,"title":["An aggregation procedure for the deterministic job-shop problem"],"prefix":"10.1007","volume":"6","author":[{"given":"Bernard","family":"Penz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lionel","family":"Dupont","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","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. and Zawack, D. (1988) The shifting bottleneck procedure for the job shop scheduling. Management Science, 34, 391?401.","journal-title":"Management Science"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/opre.4.2.244","volume":"4","author":"S. Akers","year":"1956","unstructured":"Akers, S. (1956) A graphical approach to production scheduling problems. Operation Research, 4, 244?245.","journal-title":"Operation Research"},{"key":"CR3","doi-asserted-by":"crossref","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?359.","journal-title":"Computing"},{"key":"CR4","volume-title":"Geometric methods for solving job-shop scheduling problems with two jobs","author":"P. Brucker","year":"1990","unstructured":"Brucker, P. and Jurisch, B. (1990) Geometric methods for solving job-shop scheduling problems with two jobs, in Proceedings of the Second International Workshop on Project Management and Scheduling EURO WG-ANS, Campiegne."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J. Carlier","year":"1982","unstructured":"Carlier, J. (1982) The one-machine sequencing problem. European Journal of Operations Research, 11, 42?47.","journal-title":"European Journal of Operations Research"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"Carlier, J. and Pinson, E. (1989) An algorithm for solving the job shop problem. Management Science, 35, 164?176.","journal-title":"Management Science"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M. Dell'Amico","year":"1993","unstructured":"Dell'Amico, M. and Trabin, M. (1993) Applying tabu-search to the job-shop scheduling problem. Annals of Operations Research, 41, 231?252.","journal-title":"Annals of Operations Research"},{"key":"CR8","volume-title":"Sequencing and Scheduling: an Introduction to the Mathematics of the Job-Shop","author":"S. French","year":"1982","unstructured":"French, S. (1982) Sequencing and Scheduling: an Introduction to the Mathematics of the Job-Shop; John Wiley & Sons, New York."},{"key":"CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco."},{"key":"CR10","volume-title":"Industrial Scheduling","author":"J. F. Muth","year":"1963","unstructured":"Muth, J. F. and Thompson, D. S. (1963) Industrial Scheduling, Prentice Hall, Englewood Cliffs, NJ."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"S. S. Panwalkar","year":"1977","unstructured":"Panwalkar, S. S. and Iskander, W. (1977) A survey of scheduling rules. Operations Research, 25, 45?61.","journal-title":"Operations Research"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00123683.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00123683\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00123683","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T05:16:54Z","timestamp":1554268614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00123683"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["BF00123683"],"URL":"https:\/\/doi.org\/10.1007\/bf00123683","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,4]]}}}