{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:30:23Z","timestamp":1755793823962,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030501525"},{"type":"electronic","value":"9783030501532"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50153-2_36","type":"book-chapter","created":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T21:03:01Z","timestamp":1591390981000},"page":"479-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Robust Predictive-Reactive Scheduling: An Information-Based Decision Tree Model"],"prefix":"10.1007","author":[{"given":"Tom","family":"Portoleau","sequence":"first","affiliation":[]},{"given":"Christian","family":"Artigues","sequence":"additional","affiliation":[]},{"given":"Romain","family":"Guillaume","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,5]]},"reference":[{"issue":"6","key":"36_CR1","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s10951-018-0559-z","volume":"21","author":"M van den Akker","year":"2018","unstructured":"van den Akker, M., Hoogeveen, H., Stoef, J.: Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times. J. Sched. 21(6), 607\u2013617 (2018). \nhttps:\/\/doi.org\/10.1007\/s10951-018-0559-z","journal-title":"J. Sched."},{"issue":"3","key":"36_CR2","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.orl.2007.11.005","volume":"36","author":"MA Aloulou","year":"2008","unstructured":"Aloulou, M.A., Della Croce, F.: Complexity of single machine scheduling problems under scenario-based uncertainty. Oper. Res. Lett. 36(3), 338\u2013342 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"36_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10951-017-0553-x","volume":"22","author":"M Davari","year":"2017","unstructured":"Davari, M., Demeulemeester, E.: The proactive and reactive resource-constrained project scheduling problem. J. Sched. 22(2), 211\u2013237 (2017). \nhttps:\/\/doi.org\/10.1007\/s10951-017-0553-x","journal-title":"J. Sched."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Davari, M., Demeulemeester, E.: Important classes of reactions for the proactive and reactive resource-constrained project scheduling problem. Ann. Oper. Res. 274(1\u20132), 187\u2013210 (2019)","DOI":"10.1007\/s10479-018-2899-7"},{"key":"36_CR5","unstructured":"Dearden, R., Meuleau, N., Ramakrishnan, S., Smith, D.E., Washington, R.: Incremental contingency planning. In: ICAPS-03 Workshop on Planning under Uncertainty (2003)"},{"key":"36_CR6","unstructured":"Drummond, M., Bresina, J., Swanson, K.: Just-in-case scheduling. In: AAAI, vol. 94, pp. 1098\u20131104 (1994)"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Kouvelis, P., Yu, G.: Robust Discrete Optimization and Its Applications. Kluwer Academic Publishers, Dordrecht (1997)","DOI":"10.1007\/978-1-4757-2620-6"},{"key":"36_CR8","unstructured":"Meuleau, N., Smith, D.E.: Optimal limited contingency planning. In: Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence, pp. 417\u2013426. Morgan Kaufmann Publishers Inc. (2002)"},{"key":"36_CR9","unstructured":"Nikulin, Y.: Robustness in combinatorial optimization and scheduling theory: an extended annotated bibliography. Technical report. Manuskripte aus den Instituten f\u00fcr Betriebswirtschaftslehre der Universit\u00e4t Kiel (2006)"},{"key":"36_CR10","doi-asserted-by":"publisher","unstructured":"Rajendran, C., Holthaus, O.: A comparative study of dispatching rules in dynamic flowshops and jobshops. Eur. J. Oper. Res. 116(1), 156\u2013170 (1999). \nhttps:\/\/doi.org\/10.1016\/S0377-2217(98)00023-X","DOI":"10.1016\/S0377-2217(98)00023-X"},{"issue":"3","key":"36_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10951-007-0011-2","volume":"10","author":"S Van de Vonder","year":"2007","unstructured":"Van de Vonder, S., Demeulemeester, E., Herroelen, W.: A classification of predictive-reactive project scheduling procedures. J. Sched. 10(3), 195\u2013207 (2007)","journal-title":"J. Sched."},{"issue":"3","key":"36_CR12","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.ejor.2018.08.031","volume":"277","author":"\u0130 Yan\u0131ko\u011flu","year":"2019","unstructured":"Yan\u0131ko\u011flu, \u0130., Gorissen, B.L., den Hertog, D.: A survey of adjustable robust optimization. Eur. J. Oper. Res. 277(3), 799\u2013813 (2019)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Communications in Computer and Information Science","Information Processing and Management of Uncertainty in Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50153-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T23:33:33Z","timestamp":1591400013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50153-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030501525","9783030501532"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50153-2_36","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"5 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPMU","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipmu2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipmu2020.inesc-id.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"213","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The IPMU 2020 was held virtually due to the coronavirus pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}