Reactive Recovery from Machine Breakdown in Production Scheduling with Temporal Distance and Resource Constraints

Roman Barták, Marek Vlk

2015

Abstract

One of the classical problems of real-life production scheduling is dynamics of manufacturing environments with new production demands coming and breaking machines during the schedule execution. Simple rescheduling from scratch in response to unexpected events occurring on the shop floor may require excessive computation time. Moreover, the recovered schedule may be deviated prohibitively from the ongoing schedule. This paper studies two methods how to modify a schedule in response to a resource failure: rightshift of affected activities and simple temporal network recovery. The importance is put on the speed of the rescheduling procedures as well as on the minimum deviation from the original schedule. The scheduling model is motivated by the FlowOpt project, which is based on Temporal Networks with Alternatives and supports simple temporal constraints between the activities.

References

1. Abumaizar, R. J. - Svestka, J. A. (1997). Rescheduling Job Shops under Random Disruptions. International Journal of Production Research, 35(7), 2065-2082.
2. Barták, R. - Jas?ka, M. - Novák, L. - RovenskÉ, V. - SkalickÉ, T. - Cully, M. - Sheahan, C. - Thanh-Tung, D. (2012). FlowOpt: Bridging the Gap Between Optimization Technology and Manufacturing Planners. Proceedings of ECAI 2012, pp. 1003-1004, IOS Press.
3. Brailsford, S.C. - Potts, Ch.N. - Smith, B. M. (1999). Constraint satisfaction problems: Algorithms and applications. European Journal of Operational Research 119, 557-581.
4. Dechter, R. - Meiri, I. - Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence 49(1-3), 61-95.
5. Kondrak, G. - Beek, P. van (1997). A Theoretical Evaluation of Selected Backtracking Algorithms. Artificial Intelligence 89, 365-387.
6. Ouelhadj, D. - Petrovic, S. (2009). A survey of dynamic scheduling in manufacturing systems. Journal of Scheduling, v.12 n.4, p.417-431.
7. Planken, L. R. (2008). New Algorithms for the Simple Temporal Problem. Delft, the Netherlands, 75 p. Master's thesis, Delft University of Technology.
8. Raheja, A. S. - Subramaniam, V. (2002). Reactive recovery of job shop schedules - a review. International Journal of Advanced Manufacturing Technology, 19, 756- 763.
9. SkalickÉ, T. (2011). Interactive Scheduling and Visualisation. Prague, 95 p. Master's thesis, Charles University in Prague.
10. Smith, S.F. (1994). Reactive Scheduling Systems. In: D. Brown and W. Scherer (eds.), Intelligent Scheduling Systems.
11. Vieira, G. - Herrmann, J. - Lin, E. (2003). Rescheduling manufacturing systems: a framework of strategies, policies, and methods. Journal of Scheduling 6: 39- 62, Kluwer Acad. Publishers.
12. Vlk, M. (2014). Dynamic Scheduling. Prague, 72 p. Master's thesis, Charles University in Prague.

Paper Citation

in Harvard Style

Barták R. and Vlk M. (2015). Reactive Recovery from Machine Breakdown in Production Scheduling with Temporal Distance and Resource Constraints . In Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-074-1, pages 119-130. DOI: 10.5220/0005215701190130

in Bibtex Style

@conference{icaart15,
author={Roman Barták and Marek Vlk},
title={Reactive Recovery from Machine Breakdown in Production Scheduling with Temporal Distance and Resource Constraints},
booktitle={Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2015},
pages={119-130},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005215701190130},
isbn={978-989-758-074-1},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Reactive Recovery from Machine Breakdown in Production Scheduling with Temporal Distance and Resource Constraints
SN - 978-989-758-074-1
AU - Barták R.
AU - Vlk M.
PY - 2015
SP - 119
EP - 130
DO - 10.5220/0005215701190130