CP 2016: Principles and Practice of Constraint Programming pp 520-535 | Cite as
Efficient Filtering for the Unary Resource with Family-Based Transition Times
Conference paper
First Online:
Abstract
We recently proposed an extension to Vilím’s propagators for the unary resource constraint in order to deal with sequence-dependent transition times. While it has been shown to be scalable, it suffers from an important limitation: when the transition matrix is sparse, the additional filtering, as compared to the original from Vilím’s algorithm, drops quickly. Sparse transition time matrices occur especially when activities are grouped into families with zero transition times within a family. The present work overcomes this weakness by relying on the transition times between families of activities. The approach is experimentally evaluated on instances of the Job-Shop Problem with Sequence Dependent Transition Times. Our experimental results demonstrate that the approach outperforms existing ones in most cases. Furthermore, the proposed technique scales well to large problem instances with many families and activities.
Keywords
Constraint programming Scheduling Job-Shop Sequence-dependent transition times Family Global constraint Traveling Salesman Problem Dynamic programming Lower boundReferences
- 1.Allahverdi, A., Ng, C., Cheng, T.E., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3), 985–1032 (2008)MathSciNetCrossRefMATHGoogle Scholar
- 2.Artigues, C., Belmokhtar, S., Feillet, D.: A new exact solution algorithm for the job shop problem with sequence-dependent setup times. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 37–49. Springer, Heidelberg (2004)CrossRefGoogle Scholar
- 3.Artigues, C., Feillet, D.: A branch and bound method for the job-shop problem with sequence-dependent setup times. Ann. Oper. Res. 159(1), 135–159 (2008)MathSciNetCrossRefMATHGoogle Scholar
- 4.Brucker, P., Thiele, O.: A branch & bound method for the general-shop problem with sequence dependent setup-times. Operations-Research-Spektrum 18(3), 145–161 (1996)MathSciNetCrossRefMATHGoogle Scholar
- 5.Dejemeppe, C., Van Cauwelaert, S., Schaus, P.: The unary resource with transition times. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 89–104. Springer, Heidelberg (2015)Google Scholar
- 6.Dolan, E.D., Moré, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201–213 (2002)MathSciNetCrossRefMATHGoogle Scholar
- 7.Focacci, F., Laborie, P., Nuijten, W.: Solving scheduling problems with setup times and alternative resources. In: AIPS, pp. 92–101 (2000)Google Scholar
- 8.Gay, S., Hartert, R., Lecoutre, C., Schaus, P.: Conflict ordering search for scheduling problems. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 140–148. Springer, Heidelberg (2015)Google Scholar
- 9.Gay, S., Schaus, P., De Smedt, V.: Continuous casting scheduling with constraint programming. In: O’Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 831–845. Springer, Heidelberg (2014)Google Scholar
- 10.Grimes, D., Hebrard, E.: Job shop scheduling with setup times and maximal time-lags: a simple constraint programming approach. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 147–161. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- 11.Le Pape, C., Couronné, P., Vergamini, D., Gosselin, V.: Time-versus-capacity compromises in project scheduling (1994)Google Scholar
- 12.OscaR Team: OscaR: Scala in OR (2012). https://bitbucket.org/oscarlib/oscar
- 13.Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)CrossRefGoogle Scholar
- 14.Van Cauwelaert, S., Lombardi, M., Schaus, P.: Understanding the potential of propagators. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 427–436. Springer, Heidelberg (2015)Google Scholar
- 15.Van Cauwelaert, S., Lombardi, M., Schaus, P.: A visual web tool to perform what-if analysis of optimization approaches. Technical report, UCLouvain (2016)Google Scholar
- 16.Vilım, P.: Global constraints in scheduling. Ph.D. thesis, Charles University in Prague, Faculty of Mathematics and Physics, Department of Theoretical Computer Science and Mathematical Logic, KTIML MFF, Universita Karlova, Malostranské námestı 2/25, 118 00 Praha 1, Czech Republic (2007)Google Scholar
- 17.Vilım, P., Barták, R.: Filtering algorithms for batch processing with sequence dependent setup times. In: Proceedings of the 6th International Conference on AI Planning and Scheduling, AIPS (2012)Google Scholar
- 18.Warren, H.S.: Hacker’s Delight. Pearson Education, Upper Saddle River (2013)Google Scholar
- 19.Wolf, A.: Constraint-based task scheduling with sequence dependent setup times, time windows and breaks. GI Jahrestagung 154, 3205–3219 (2009)Google Scholar
- 20.Zampelli, S., Vergados, Y., Van Schaeren, R., Dullaert, W., Raa, B.: The berth allocation and quay crane assignment problem using a CP approach. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 880–896. Springer, Heidelberg (2013)CrossRefGoogle Scholar
Copyright information
© Springer International Publishing Switzerland 2016