{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:10:50Z","timestamp":1725459050946},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540198932"},{"type":"electronic","value":"9783540393375"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0035529","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:09:36Z","timestamp":1138201776000},"page":"795-804","source":"Crossref","is-referenced-by-count":0,"title":["A stochastic scheduling problem issued from iron and steel industry : Some results"],"prefix":"10.1007","author":[{"given":"Brigitte","family":"Finel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-Claude","family":"Portmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,23]]},"reference":[{"key":"74_CR1","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1287\/opre.31.5.938","volume":"31","author":"E. Baker","year":"1983","unstructured":"E. BAKER, An Exact Algorithm for the Time Constrained Traveling Salesman Problem, Oper. Res., 31, 938\u2013945, 1983","journal-title":"Oper. Res."},{"key":"74_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF02283745","volume":"16","author":"M. Bartusch","year":"1988","unstructured":"M. BARTUSCH, R.H. M\u00d4HRING, F.J. RADERMACHER, Scheduling project networks with resource constraints and time windows, Annals of Operations research, Vol 16, 201\u2013240, 1988","journal-title":"Annals of Operations research"},{"issue":"4","key":"74_CR3","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1287\/opre.39.4.601","volume":"39","author":"D. J. Bertsimas","year":"1991","unstructured":"D. J. BERTSIMAS, G. VAN RYSIN, A stochastic and dynamic vehicule routing problem in the euclidean plane, Oper. Res., 39 no 4, 601\u2013605, 1991","journal-title":"Oper. Res."},{"key":"74_CR4","unstructured":"C. CHU, B. FINEL, M.C. PORTMANN, J. M. PROTH, N. SAUER, Simulation de politiques d'ordonnancement de machines, INRIA-LORRAINE, Rapport no2, Project EUREKA, mars 1992"},{"key":"74_CR5","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/0377-2217(88)90034-3","volume":"35","author":"M. Desrochers","year":"1988","unstructured":"M. DESROCHERS, F. SOUMIS, A reoptimization algorithm for the shortest path problem with time windows, European Journal of Operational Research, Vol 35, 242\u2013254, 1988","journal-title":"European Journal of Operational Research"},{"key":"74_CR6","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0377-2217(89)90106-9","volume":"38","author":"J.A. Ferland","year":"1989","unstructured":"J.A. FERLAND, L. FORTIN, Vehicles scheduling with sliding time windows, European Journal of Operational Research, Vol 38, 213\u2013226, 1989","journal-title":"European Journal of Operational Research"},{"key":"74_CR7","unstructured":"B. FINEL, Ordonnancement \u00e0 contrainte cumulative en univers d\u00e9terministe et stochastique: allocation dynamique de machines \u00e0 briqueter \u00e0 des convertisseurs, M\u00e9moire CNAM, CAMOS, Metz, 16 octobre 1992"},{"key":"74_CR8","volume-title":"Computers and intractability: a guide to the theory of NP-completness","author":"M.R. Garey","year":"1979","unstructured":"M.R. GAREY, R.L. GRAHAM, D.S. JOHNSON, Computers and intractability: a guide to the theory of NP-completness, Freeman, San Francisco, 1979"},{"issue":"4","key":"74_CR9","first-page":"353","volume":"18","author":"A. Guinet","year":"1984","unstructured":"A. GUINET, Transports industriels routiers, un probl\u00e8me d'affectation avec r\u00e9emplois sous contraintes, R.A.I.R.O. Recherche op\u00e9rationnelle, Vol 18, 353\u2013379, no 4, novembre 1984","journal-title":"Recherche op\u00e9rationnelle"},{"key":"74_CR10","doi-asserted-by":"crossref","unstructured":"M. HAOURI, P. DEJAX, M. DESROCHERS, Routing problems with time windows constraints, state of art, Rairo Recherche op\u00e9rationnelle, Vol 24, no 3, 217\u2013244, 1990","DOI":"10.1051\/ro\/1990240302171"},{"key":"74_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"H.W. KUHN, The hungarian method for the assignment problem, Naval Research Logist. Quart., no 2, 83\u201397, 1955","journal-title":"Naval Research Logist. Quart."},{"key":"74_CR12","unstructured":"B. ROY, Alg\u00e8bre moderne et th\u00e9orie des graphes, Tome 2, ch 8, DUNOD, 1970"},{"key":"74_CR13","unstructured":"P. WURTH S.A., Highly flexible automated and integreted bricklaying system, FAMOS project, Definition Study, septembre 1989"}],"container-title":["Lecture Notes in Control and Information Sciences","System Modelling and Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T14:32:23Z","timestamp":1555425143000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540198932","9783540393375"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0035529","relation":{},"ISSN":["0170-8643","1610-7411"],"issn-type":[{"type":"print","value":"0170-8643"},{"type":"electronic","value":"1610-7411"}],"subject":[],"published":{"date-parts":[[1994]]}}}