Abstract
This paper deals with the flexible job-shop scheduling problem (FJSP): an amount of jobs have to be executed by a limited number of resources that can be exchanged for some tasks. Solving such a schedule consists in allocating a resource for each task in the jobs. But one must be able to cope with unexpected changes in the model, i.e. uncertainties such as a modification of the duration of some tasks, or an additional job, or a resource that is added or removed... Yet, for operational reasons, the change in the schedule must remain little. We propose a domain-independent plan adaptation algorithm satisfying those requirements, which principle is to move tasks within the plan like sliding puzzle pieces. This algorithm is also able to cope with uncertainties on the tasks duration. It does not need the initial solver. This local search approach is compared to another, a classical tabu search [7] in which we introduced several criteria.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aligne, F.: Which information and decision support system for crisis management? In: Proc. of Information Syst. Technology Panel Symp (IST-086/RSY-019), C3I for Crisis, Emergency and Consequence Management (May 2009)
Aligne, F., Savéant, P.: Automated planning in evolving contexts: an emergency planning model with traffic prediction and control. In: Proc. Future Security Conf., Bonn, Germany, September 4-6 (2011)
Alterman, R.: Adaptive Planning. Cognitive Science 12(3), 393–421 (1988)
Beaudry, E., Kabanza, F., Michaud, F.: Planning for concurrent action executions under action duration uncertainty using dynamically generated bayesian networks. In: ICAPS, pp. 10–17 (2010)
Coles, A.J., Coles, A.I., Clark, A., Gilmore, S.T.: Cost-sensitive concurrent planning under duration uncertainty for service level agreements. In: Proceedings of the Twenty First International Conference on Automated Planning and Scheduling (ICAPS 2011) (June 2011)
Fox, M., Gerevini, A., Long, D., Serina, I.: Plan stability: Replanning Versus Plan Repair. In: 16th Int. Conf. on Automated Planning and Scheduling (ICAPS 2006), pp. 212–221. AAAI Press (2006)
Gambardella, L., Mastrolilli, M.: Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling 3(3) (1996)
Gerevini, A., Serina, I.: Fast Plan Adaptation through Planning Graphs: Local and Systematic Search Techniques. In: 5th Int. Conf. on AI Planning and Scheduling (AIPS 2000), pp. 112–121. AAAI Press, Menlo Park (2000)
Huang, Y., Zheng, L., Williams, B.C., Tang, L., Yang, H.: Incremental temporal reasoning in job shop scheduling repair. In: 2010 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), pp. 1276–1280. IEEE (2010)
Kambhampati, S., Hendler, J.A.: A Validation-Structure-Based Theory of Plan Modification and Reuse. Artificial Intelligence 55(2-3), 193–258 (1992)
van der Krogt, R., de Weerdt, M.: Plan Repair as an Extension of Planning. In: 15th International Conference on Automated Planning and Scheduling (ICAPS 2005), pp. 161–170. AAAI Press (2005)
Nebel, B., Koehler, J.: Plan Reuse versus Plan Generation: A Theoretical and Empirical Analysis. Artificial Intelligence 76, 427–454 (1995)
Vidal, V., Geffner, H.: Branching and Pruning: An Optimal Temporal POCL Planner based on Constraint Programming. Artificial Intelligence 170(3), 298–335 (2006)
Zhang, G., Shi, Y., Gao, L.: A genetic algorithm and tabu search for solving flexible job shop schedules. In: International Symposium on Computational Intelligence and Design, ISCID 2008, vol. 1, pp. 369–372. IEEE (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Soubaras, H. (2015). Reactive Multiobjective Local Search Schedule Adaptation and Repair in Flexible Job-Shop Problems. In: Le Thi, H., Pham Dinh, T., Nguyen, N. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. Advances in Intelligent Systems and Computing, vol 359. Springer, Cham. https://doi.org/10.1007/978-3-319-18161-5_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-18161-5_21
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18160-8
Online ISBN: 978-3-319-18161-5
eBook Packages: EngineeringEngineering (R0)