{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:55:25Z","timestamp":1725490525501},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74484-9_89","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T21:48:03Z","timestamp":1188337683000},"page":"1027-1036","source":"Crossref","is-referenced-by-count":6,"title":["Worst-Case Evaluation of Flexible Solutions in Disjunctive Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Mohamed Ali","family":"Aloulou","sequence":"first","affiliation":[]},{"given":"Christian","family":"Artigues","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"89_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/B:ANOR.0000030679.25466.02","volume":"129","author":"M. Aloulou","year":"2004","unstructured":"Aloulou, M., Kovalyov, M., Portmann, M.C.: Maximization in single machine scheduling. Annals of Operations Research\u00a0129, 21\u201332 (2004)","journal-title":"Annals of Operations Research"},{"key":"89_CR2","first-page":"13","volume-title":"Multidisciplinary Scheduling: Theory and Applications","author":"M.A. Aloulou","year":"2005","unstructured":"Aloulou, M.A., Portmann, M.-C.: An efficient proactive-reactive scheduling approach to hedge against shop floor disturbance (Selected Papers). In: Kendall, G., Burke, E.K., Petrovic, S., Gendreau, M. (eds.) Multidisciplinary Scheduling: Theory and Applications. 1st International Conference, MISTA \u201903, Nottingham, UK, 13-15 August 2003, pp. 13\u201315. Elsevier, Amsterdam (2005)"},{"issue":"2","key":"89_CR3","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.ejor.2004.04.004","volume":"165","author":"C. Artigues","year":"2005","unstructured":"Artigues, C., Billaut, J.C., Esswein, C.: Maximization of solution flexibility for robust shop scheduling. European Journal of Operational Research\u00a0165(2), 314\u2013328 (2005)","journal-title":"European Journal of Operational Research"},{"key":"89_CR4","volume-title":"Introduction to sequencing and scheduling","author":"K.R. Baker","year":"1974","unstructured":"Baker, K.R.: Introduction to sequencing and scheduling. Wiley, Chichester (1974)"},{"issue":"6","key":"89_CR5","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1080\/00207549608904984","volume":"34","author":"J.C. Billaut","year":"1996","unstructured":"Billaut, J.C., Roubellat, F.: A new method for workshop real time scheduling. International Journal of Production Research\u00a034(6), 1555\u20131579 (1996)","journal-title":"International Journal of Production Research"},{"key":"89_CR6","volume-title":"Advances in project scheduling","author":"J. Erschler","year":"1989","unstructured":"Erschler, J., Roubellat, F.: An approach for real time scheduling for activities with time and resource constraints. In: Slowinski, R., Weglarz, J. (eds.) Advances in project scheduling, Elsevier, Amsterdam (1989)"},{"issue":"3","key":"89_CR7","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1016\/j.ejor.2004.01.029","volume":"167","author":"C. Esswein","year":"2005","unstructured":"Esswein, C., Billaut, J.C., Strusevich, V.: Two-machine shop scheduling: Compromise between flexibility and makespan value. European Journal of Operational Research\u00a0167(3), 796\u2013809 (2005)","journal-title":"European Journal of Operational Research"},{"key":"89_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"89_CR9","doi-asserted-by":"crossref","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Annals of Discrete Mathematics\u00a01 (1977)","DOI":"10.1016\/S0167-5060(08)70743-X"},{"key":"89_CR10","doi-asserted-by":"crossref","unstructured":"Posner, M.E.: Reducibility among wighted completion time scheduling problems. Annals of Operations Research, 91\u2013101 (1990)","DOI":"10.1007\/BF02248586"},{"key":"89_CR11","unstructured":"Roy, B., Sussmann, B.: Les probl\u00e8mes d\u2019ordonnancement avec contraintes disjonctives, D.S. vol. 9, SEMA, Paris, France (1964)"},{"issue":"1","key":"89_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/opre.47.1.113","volume":"47","author":"S.D. Wu","year":"1999","unstructured":"Wu, S.D., Byeon, E.S., Storer, R.H.: A graph-theoretic decomposition of the job-shop scheduling problem to achieve scheduling robustness. Operations Research\u00a047(1), 113\u2013124 (1999)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74484-9_89.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:33:46Z","timestamp":1619519626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74484-9_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744825"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74484-9_89","relation":{},"subject":[]}}