{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T04:58:13Z","timestamp":1773637093778,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,8,23]],"date-time":"2008-08-23T00:00:00Z","timestamp":1219449600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s10951-008-0080-x","type":"journal-article","created":{"date-parts":[[2008,8,22]],"date-time":"2008-08-22T12:45:30Z","timestamp":1219409130000},"page":"315-344","source":"Crossref","is-referenced-by-count":65,"title":["A theoretic and practical framework for scheduling in a stochastic environment"],"prefix":"10.1007","volume":"12","author":[{"given":"Julien","family":"Bidot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Laborie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,8,23]]},"reference":[{"key":"80_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., & Zawack, D. (1988). The shifting bottleneck procedure for job-shop scheduling. Management Science, 34, 391\u2013401.","journal-title":"Management Science"},{"issue":"2","key":"80_CR2","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1080\/095372899233299","volume":"10","author":"M. S. Akt\u00fcrk","year":"1999","unstructured":"Akt\u00fcrk, M. S., & Yildirim, M. B. (1999). A new dominance rule for the total weighted tardiness problem. Production Planning and Control, 10(2), 138\u2013149.","journal-title":"Production Planning and Control"},{"issue":"2","key":"80_CR3","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 computational study of the job-shop scheduling problem. ORSA Journal on Computing, 3(2), 149\u2013156.","journal-title":"ORSA Journal on Computing"},{"key":"80_CR4","unstructured":"Baptiste, P., & Le Pape, C. (1996). Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. In Proceedings of the fifteenth workshop of the UK planning special interest group, Liverpool, United Kingdom."},{"key":"80_CR5","unstructured":"Beck, J. C. (1999). Texture measurements as a basis for heuristic commitment techniques in constraint-directed scheduling. Ph.D. dissertation, University of Toronto, Toronto, Canada."},{"issue":"1\u20132","key":"80_CR6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0004-3702(00)00035-7","volume":"121","author":"J. C. Beck","year":"2000","unstructured":"Beck, J. C., & Fox, M. S. (2000). Constraint-directed techniques for scheduling with alternative activities. Artificial Intelligence, 121(1\u20132), 211\u2013250.","journal-title":"Artificial Intelligence"},{"key":"80_CR7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1613\/jair.2080","volume":"28","author":"J. C. Beck","year":"2007","unstructured":"Beck, J. C., & Wilson, N. (2007). Proactive algorithms for job shop scheduling with probabilistic durations. Journal of Artificial Intelligence Research, 28, 183\u2013232.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"80_CR8","unstructured":"Bidot, J., Laborie, P., Beck, J. C., & Vidal, T. (2003). Using simulation for execution monitoring and on-line rescheduling with uncertain durations. In Working notes of the ICAPS\u201903 workshop on plan execution, Trento, Italy, June 2003."},{"key":"80_CR9","doi-asserted-by":"crossref","unstructured":"Bidot, J., Laborie, P., Beck, J. C., & Vidal, T. (2006). Using constraint programming and simulation for execution monitoring and progressive scheduling. In Proceedings of the twelfth IFAC symposium on information control problems in manufacturing (INCOM 2006) (pp. 595\u2013600). Saint-\u00c9tienne, France, May 2006.","DOI":"10.3182\/20060517-3-FR-2903.00313"},{"key":"80_CR10","unstructured":"Bidot, J., Vidal, T., Laborie, P., & Beck, J. C. (2007). A general framework for scheduling in a stochastic environment. In Proceedings of the 20th international joint conference on artificial intelligence (IJCAI) (pp. 56\u201361). Hyderabad, India, January 2007."},{"key":"80_CR11","unstructured":"Billaut, J.-C., Moukrim, A., & Sanlaville, E. (Eds.) (2007). Flexibility and robustness in scheduling. Control Systems, Robotics and Manufacturing. ISTE."},{"key":"80_CR12","unstructured":"Branke, J., & Mattfeld, D. C. (2002). Anticipatory scheduling for dynamic job-shop problems. In G. Verfaillie (Ed.), Working notes of the AIPS\u201902 workshop on on-line planning and scheduling (pp. 3\u201310). Toulouse, France, April 2002."},{"key":"80_CR13","unstructured":"Bresina, J. L., Dearden, R., Meuleau, N., Ramakrishnan, S., Smith, D. E., & Washington, R. (2002). Planning under continuous time and resource uncertainty: A challenge for AI. In Proceedings of the 18th conference on uncertainty in artificial intelligence (UAI) (pp. 77\u201384). Edmonton, Alberta, Canada, August 2002."},{"key":"80_CR14","first-page":"300","volume-title":"Proceedings of the fifth international conference on artificial intelligence planning and scheduling (AIPS)","author":"S. A. Chien","year":"2000","unstructured":"Chien, S. A., Knight, R., Stechert, A., Sherwood, R., & Rabideau, G. (2000). Using iterative repair to improve the responsiveness of planning and scheduling. In S. A. Chien, S. Kambhampati, & C.\u00a0A. Knoblock (Eds.), Proceedings of the fifth international conference on artificial intelligence planning and scheduling (AIPS). Breckenridge, CO, USA, April 2000. (pp. 300\u2013307). Menlo Park: AAAI Press."},{"key":"80_CR15","unstructured":"Davenport, A. J., Gefflot, C., & Beck, J. C. (2001). Slack-based techniques for building robust schedules. In Proceedings of the sixth European conference on planning (ECP). Toledo, Spain, September 2001."},{"key":"80_CR16","unstructured":"Drummond, M., Bresina, J. L., & Swanson, K. (1994). Just-In-Case scheduling. In Proceedings of the 12th national conference on artificial intelligence (AAAI) (pp. 1098\u20131104). Seattle, WA, USA, July 1994."},{"key":"80_CR17","unstructured":"Dubois, D., Fargier, H., & Prade, H. (1993). The use of fuzzy constraints in job-shop scheduling. In Working notes of the IJCAI\u201993 workshop on knowledge-based production planning, scheduling, and control (pp. 101\u2013112). Chamb\u00e9ry, France, August 1993."},{"key":"80_CR18","unstructured":"Erschler, J. (1976). Analyse sous contraintes et aide \u00e0 la d\u00e9cision pour certains probl\u00e8mes d\u2019ordonnancement. Ph.D. dissertation, Universit\u00e9 Paul Sabatier, Toulouse, France."},{"key":"80_CR19","unstructured":"Fargier, H., Lang, J., & Schiex, T. (1996). Mixed constraint satisfaction: A framework for decision problems under incomplete knowledge. In Proceedings of the 13th national conference on artificial intelligence (AAAI) (pp. 175\u2013180). Portland, OR, USA, August 1996."},{"key":"80_CR20","unstructured":"Gao, H. (1995). Building robust schedules using temporal protection\u2014an empirical study of constraint-based scheduling under machine failure uncertainty. Master\u2019s thesis, Department of Industrial Engineering, University of Toronto, Toronto, Canada."},{"key":"80_CR21","series-title":"Lecture notes in AI","first-page":"1","volume-title":"Proceedings of iberamia 98","author":"H. Geffner","year":"1998","unstructured":"Geffner, H. (1998). Modeling intelligent behaviour: The Markov decision process approach. In H. Coelho (Ed.), Lecture notes in AI : Vol. 1484. Proceedings of iberamia 98 (pp. 1\u201312). New York: Springer. Invited talk."},{"key":"80_CR22","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/net.3230180206","volume":"18","author":"J. N. Hagstrom","year":"1988","unstructured":"Hagstrom, J. N. (1988). Computational complexity of PERT problems. Networks, 18, 139\u2013147.","journal-title":"Networks"},{"issue":"2","key":"80_CR23","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.ejor.2004.04.002","volume":"165","author":"W. S. Herroelen","year":"2005","unstructured":"Herroelen, W. S., & Leus, R. (2005). Project scheduling under uncertainty: Survey and research potentials. European Journal of Operational Research, 165(2), 289\u2013306.","journal-title":"European Journal of Operational Research"},{"key":"80_CR24","unstructured":"Hildum, D. W. (1994). Flexibility in a knowledge-based system for solving dynamic resource-constrained scheduling problems. Ph.D. dissertation, Department of Computer Science, University of Massachusetts Amherst, September 1994."},{"key":"80_CR25","unstructured":"ILOG S.\u2009A. (2002). ILOG scheduler 5.3: reference manual and user\u2019s manual."},{"issue":"1\u20132","key":"80_CR26","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0004-3702(94)00087-H","volume":"76","author":"N. Kushmerick","year":"1995","unstructured":"Kushmerick, N., Hanks, S., & Weld, D. S. (1995). An algorithm for probabilistic planning. Artificial Intelligence, 76(1\u20132), 239\u2013286.","journal-title":"Artificial Intelligence"},{"key":"80_CR27","unstructured":"La, H. T. (2005). Utilisation d\u2019ordres partiels pour la caract\u00e9risation de solutions robustes en ordonnancement. Ph.D. dissertation, Institut National des Sciences Appliqu\u00e9es de Toulouse, Toulouse, France, January 2005."},{"key":"80_CR28","unstructured":"Lawrence, S. R. (1984). Resource-constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Ph.D. dissertation, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, USA."},{"key":"80_CR29","unstructured":"Lemai, S., & Ingrand, F. F. (2004). Interleaving temporal planning and execution in robotics domains. In Proceedings of the 19th national conference on artificial intelligence (AAAI). San Jose, CA, USA, July 2004."},{"key":"80_CR30","unstructured":"Morris, P. H., Muscettola, N., & Vidal, T. (2001). Dynamic control of plans with temporal uncertainty. In Proceedings of the 17th international joint conference on artificial intelligence (IJCAI) (pp. 494\u2013502). Seattle, WA, USA, August 2001."},{"key":"80_CR31","volume-title":"Heuristic scheduling systems with applications to production systems and project management","author":"T. E. Morton","year":"1993","unstructured":"Morton, T. E., & Pentico, D. W. (1993). Heuristic scheduling systems with applications to production systems and project management. New York: Wiley."},{"key":"80_CR32","first-page":"169","volume-title":"Intelligent scheduling","author":"N. Muscettola","year":"1994","unstructured":"Muscettola, N. (1994). HSTS: Integrating planning and scheduling. In M. Zweben & M. S. Fox (Eds.), Intelligent scheduling (pp. 169\u2013212). Morgan Kaufmann: San Mateo."},{"key":"80_CR33","doi-asserted-by":"crossref","unstructured":"Muscettola, N. (2002). Computing the envelope for stepwise-constant resource allocations. In Proceedings of the eighth international conference on principles and practice of constraint programming (CP) (pp. 139\u2013154). Cornell University, New York, USA, September 2002.","DOI":"10.1007\/3-540-46135-3_10"},{"key":"80_CR34","volume-title":"Principles of artificial intelligence","author":"N. J. Nilsson","year":"1980","unstructured":"Nilsson, N. J. (1980). Principles of artificial intelligence. Morgan Kaufmann: San Mateo."},{"key":"80_CR35","unstructured":"Nuijten, W. P. M. (1994). Time- and resource-constrained scheduling. A constraint-satisfaction approach. Ph.D. dissertation, Technische Universiteit Eindhoven, Eindhoven, Netherlands."},{"key":"80_CR36","unstructured":"Policella, N., Oddi, A., Smith, S. F., & Cesta, A. (2004). Generating robust schedules through chaining. In Proceedings of the tenth international conference on principles and practice of constraint programming (CP) (pp. 496\u2013511). Toronto, Canada, September 2004."},{"key":"80_CR37","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov decision processes: discrete stochastic dynamic programming","author":"M. L. Puterman","year":"1994","unstructured":"Puterman, M. L. (1994). Markov decision processes: discrete stochastic dynamic programming. New York: Wiley."},{"key":"80_CR38","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/S0377-2217(99)00311-2","volume":"126","author":"I. Sabuncuoglu","year":"2000","unstructured":"Sabuncuoglu, I., & Bayiz, M. (2000). Analysis of reactive scheduling problems in a job-shop environment. European Journal of Operational Research, 126, 567\u2013586.","journal-title":"European Journal of Operational Research"},{"key":"80_CR39","first-page":"99","volume-title":"Intelligent scheduling","author":"N. M. Sadeh","year":"1994","unstructured":"Sadeh, N. M. (1994). Micro-opportunistic scheduling: The Micro-Boss factory scheduler. In M. Zweben & M. S. Fox (Eds.), Intelligent scheduling (pp. 99\u2013135). Morgan Kaufmann: San Mateo. Chap.\u00a04."},{"key":"80_CR40","unstructured":"Sadeh, N. M., Otsuka, S., & Schnelbach, R. (1993). Predictive and reactive scheduling with the Micro-Boss production scheduling and control system. In Working notes of the IJCAI\u201993 workshop on knowledge-based production planning, scheduling, and control (pp. 293\u2013306). Chamb\u00e9ry, France, August 1993."},{"key":"80_CR41","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1023\/A:1009856210543","volume":"5","author":"H. El Sakkout","year":"2000","unstructured":"El Sakkout, H., & Wallace, M. (2000). Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints, 5, 359\u2013388.","journal-title":"Constraints"},{"issue":"17","key":"80_CR42","doi-asserted-by":"crossref","first-page":"3913","DOI":"10.1080\/002075499189835","volume":"37","author":"R. Shafaei","year":"1999","unstructured":"Shafaei, R., & Brunn, P. (1999a). Workshop scheduling using practical (inaccurate) data. Part 1: The performance of heuristic scheduling rules in a dynamic job-shop environment using a rolling time horizon approach. International Journal of Production Research, 37(17), 3913\u20133925.","journal-title":"International Journal of Production Research"},{"issue":"18","key":"80_CR43","doi-asserted-by":"crossref","first-page":"4105","DOI":"10.1080\/002075499189682","volume":"37","author":"R. Shafaei","year":"1999","unstructured":"Shafaei, R., & Brunn, P. (1999b). Workshop scheduling using practical (inaccurate) data. Part 2: An investigation of the robustness of scheduling rules in a dynamic and stochastic environment. International Journal of Production Research, 37(18), 4105\u20134117.","journal-title":"International Journal of Production Research"},{"key":"80_CR44","first-page":"29","volume-title":"Intelligent scheduling","author":"S. F. Smith","year":"1994","unstructured":"Smith, S. F. (1994). OPIS: A methodology and architecture for reactive scheduling. In M. Zweben & M. S. Fox (Eds.), Intelligent scheduling (pp. 29\u201366). Morgan Kaufmann: San Mateo."},{"issue":"1","key":"80_CR45","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1017\/S0269888900001089","volume":"15","author":"D. E. Smith","year":"2000","unstructured":"Smith, D. E., Frank, J., & J\u00f3nsson, A. K. (2000). Bridging the gap between planning and scheduling. Knowledge Engineering Review, 15(1), 61\u201394.","journal-title":"Knowledge Engineering Review"},{"issue":"4","key":"80_CR46","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1023\/A:1025894003623","volume":"8","author":"I. Tsamardinos","year":"2003","unstructured":"Tsamardinos, I., Vidal, T., & Pollack, M. E. (2003). CTP: A new constraint-based formalism for conditional, temporal planning. Constraints, 8(4), 365\u2013388.","journal-title":"Constraints"},{"key":"80_CR47","doi-asserted-by":"crossref","unstructured":"Vidal, T., Ghallab, M., & Alami, R. (1996). Incremental mission allocation to a large team of robots. In Proceedings of the IEEE international conference on robotics and automation (ICRA\u201996) (Vol. 2, pp. 1620\u20131625). Minneapolis, MN, USA.","DOI":"10.1109\/ROBOT.1996.506944"},{"key":"80_CR48","doi-asserted-by":"crossref","unstructured":"Wang, X., & Chien, S. A. (1997). Replanning using hierarchical task network and operator-based planning. In Proceedings of the fourth European conference on planning (ECP) (pp. 427\u2013439). Toulouse, France, September 1997.","DOI":"10.1007\/3-540-63912-8_104"},{"key":"80_CR49","doi-asserted-by":"crossref","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. (1999). A graph-theoretic decomposition of the job-shop scheduling problem to achieve scheduling robustness. Operations Research, 47, 113\u2013123.","journal-title":"Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0080-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-008-0080-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0080-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:41Z","timestamp":1559453981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-008-0080-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,23]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["80"],"URL":"https:\/\/doi.org\/10.1007\/s10951-008-0080-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8,23]]}}}