{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T21:48:08Z","timestamp":1780523288721,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642406263","type":"print"},{"value":"9783642406270","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40627-0_47","type":"book-chapter","created":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T07:11:01Z","timestamp":1378537861000},"page":"628-644","source":"Crossref","is-referenced-by-count":11,"title":["Scheduling Optional Tasks with Explanation"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Schutt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thibaut","family":"Feydy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"47_CR1","unstructured":"Bart\u00e1k, R., \u010cepek, O.: Temporal networks with alternatives: Complexity and model. In: Proceedings of the Twentieth International Florida AI Research Society Conference (FLAIRS), pp. 641\u2013646 (2007)"},{"key":"47_CR2","unstructured":"Beck, J.C., Fox, M.S.: Scheduling alternative activities. In: Proceedings of the National Conference on Artificial Intelligence, pp. 680\u2013687. John Wiley & Sons, Ltd. (1999)"},{"key":"47_CR3","unstructured":"Behnke, D., Geiger, M.J.: Test instances for the flexible job shop scheduling problem with work centers. Research Report RR-12-01-01, Helmut-Schmidt-Universit\u00e4t, Hamburg, Germany (2012)"},{"issue":"3","key":"47_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P. Brandimarte","year":"1993","unstructured":"Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research\u00a041(3), 157\u2013183 (1993)","journal-title":"Annals of Operations Research"},{"issue":"4","key":"47_CR5","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P. Brucker","year":"1990","unstructured":"Brucker, P., Schlie, R.: Job-shop scheduling with multi-purpose machines. Computing\u00a045(4), 369\u2013375 (1990)","journal-title":"Computing"},{"key":"47_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-23786-7_23","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"T. Feydy","year":"2011","unstructured":"Feydy, T., Somogyi, Z., Stuckey, P.J.: Half reification and flattening. In: Lee, J. (ed.) CP 2011. LNCS, vol.\u00a06876, pp. 286\u2013301. Springer, Heidelberg (2011)"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Feydy, T., Stuckey, P.J.: Lazy clause generation reengineered. In: Gent [8], pp. 352\u2013366","DOI":"10.1007\/978-3-642-04244-7_29"},{"key":"47_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming - CP 2009","year":"2009","unstructured":"Gent, I.P. (ed.): CP 2009. LNCS, vol.\u00a05732. Springer, Heidelberg (2009)"},{"issue":"4","key":"47_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01719451","volume":"15","author":"J. Hurink","year":"1994","unstructured":"Hurink, J., Jurisch, B., Thole, M.: Tabu search for the job-shop scheduling problem with multi-purpose machines. Operations-Research-Spektrum\u00a015(4), 205\u2013215 (1994)","journal-title":"Operations-Research-Spektrum"},{"key":"47_CR10","unstructured":"Jurisch, B.: Scheduling jobs in shops with multi-purpose machines. Ph.D. thesis, Universit\u00e4t Osnabr\u00fcck (1992)"},{"key":"47_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-01929-6_12","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P. Laborie","year":"2009","unstructured":"Laborie, P.: IBM ILOG CP Optimizer for detailed scheduling illustrated on three problems. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 148\u2013162. Springer, Heidelberg (2009)"},{"key":"47_CR12","unstructured":"Laborie, P., Rogerie, J.: Reasoning with conditional time-intervals. In: Wilson, D.C., Lane, H.C. (eds.) Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, pp. 555\u2013560. AAAI Press (2008)"},{"key":"47_CR13","unstructured":"Laborie, P., Rogerie, J., Shaw, P., Vil\u00edm, P.: Reasoning with conditional time-intervals part II: An algebraical model for resources. In: Lane, H.C., Guesgen, H.W. (eds.) Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, pp. 201\u2013206. AAAI Press (2009)"},{"key":"47_CR14","series-title":"Applied Optimization","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-23592-4_6","volume-title":"Algebraic Modeling Systems","author":"P. Laborie","year":"2012","unstructured":"Laborie, P., Rogerie, J., Shaw, P., Vil\u00edm, P., Katai, F.: Interval-based language for modeling scheduling problems: An extension to constraint programming. In: Kallrath, J. (ed.) Algebraic Modeling Systems. Applied Optimization, vol.\u00a0104, pp. 111\u2013143. Springer, Heidelberg (2012)"},{"issue":"1","key":"47_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","volume":"3","author":"M. Mastrolilli","year":"2000","unstructured":"Mastrolilli, M., Gambardella, L.M.: Effective neighbourhood functions for the flexible job shop problem. Journal of Scheduling\u00a03(1), 3\u201320 (2000)","journal-title":"Journal of Scheduling"},{"key":"47_CR16","unstructured":"Moffitt, M.D., Peintner, B., Pollack, M.E.: Augmenting disjunctive temporal problems with finite-domain constraints. In: Proceedings of the National Conference on Artificial Intelligence, pp. 1187\u20131192. AAAI Press (2005)"},{"key":"47_CR17","first-page":"530","volume-title":"Proceedings of Design Automation Conference \u2013 DAC 2001","author":"M.W. Moskewicz","year":"2001","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of Design Automation Conference \u2013 DAC 2001, pp. 530\u2013535. ACM, New York (2001)"},{"key":"47_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N. Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.R.: MiniZinc: Towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 529\u2013543. Springer, Heidelberg (2007)"},{"issue":"3","key":"47_CR19","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O. Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation via lazy clause generation. Constraints\u00a014(3), 357\u2013391 (2009)","journal-title":"Constraints"},{"key":"47_CR20","unstructured":"Pacino, D., Van Hentenryck, P.: Large neighborhood search and adaptive randomized decompositions for flexible jobshop scheduling. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI 2011, pp. 1997\u20132002. AAAI Press (2011)"},{"issue":"1","key":"47_CR21","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1452044.1452046","volume":"31","author":"C. Schulte","year":"2008","unstructured":"Schulte, C., Stuckey, P.J.: Efficient constraint propagation engines. ACM Transactions on Programming Languages and Systems\u00a031(1), Article No. 2 (2008)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"47_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-642-29828-8_24","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"A. Schutt","year":"2012","unstructured":"Schutt, A., Chu, G., Stuckey, P.J., Wallace, M.G.: Maximising the net present value for resource-constrained project scheduling. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol.\u00a07298, pp. 362\u2013378. Springer, Heidelberg (2012)"},{"key":"47_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-38171-3_16","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"A. Schutt","year":"2013","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J.: Explaining time-table-edge-finding propagation for the cumulative resource constraint. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol.\u00a07874, pp. 234\u2013250. Springer, Heidelberg (2013)"},{"issue":"3","key":"47_CR24","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/s10601-010-9103-2","volume":"16","author":"A. Schutt","year":"2011","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Explaining the cumulative propagator. Constraints\u00a016(3), 250\u2013282 (2011)","journal-title":"Constraints"},{"issue":"3","key":"47_CR25","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10951-012-0285-x","volume":"16","author":"A. Schutt","year":"2013","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Solving RCPSP\/max by lazy clause generation. Journal of Scheduling\u00a016(3), 273\u2013289 (2013)","journal-title":"Journal of Scheduling"},{"key":"47_CR26","series-title":"Lecture Notes in Computer Science","volume-title":"Applications of Declarative Programming and Knowledge Management","year":"2009","unstructured":"Seipel, D., Hanus, M., Wolf, A. (eds.): INAP 2007. LNCS, vol.\u00a05437. Springer, Heidelberg (2009)"},{"key":"47_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/11562931_3","volume-title":"Logic Programming","author":"P.J. Stuckey","year":"2005","unstructured":"Stuckey, P.J., de la Banda, M.G., Maher, M.J., Marriott, K., Slaney, J.K., Somogyi, Z., Wallace, M., Walsh, T.: The G12 project: Mapping solver independent models to efficient solutions. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 9\u201313. Springer, Heidelberg (2005)"},{"key":"47_CR28","doi-asserted-by":"crossref","unstructured":"Vil\u00edm, P.: Edge finding filtering algorithm for discrete cumulative resources in \n                    \n                      \n                    \n                    ${\\mathcal O}(kn\\log n)$\n                  . In: Gent [8], pp. 802\u2013816","DOI":"10.1007\/978-3-642-04244-7_62"},{"key":"47_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-01929-6_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P. Vil\u00edm","year":"2009","unstructured":"Vil\u00edm, P.: Max energy filtering algorithm for discrete cumulative resources. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 294\u2013308. Springer, Heidelberg (2009)"},{"issue":"4","key":"47_CR30","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10601-005-2814-0","volume":"10","author":"P. Vil\u00edm","year":"2005","unstructured":"Vil\u00edm, P., Bart\u00e1k, R., \u010cepek, O.: Extension of O(n logn) filtering algorithms for the unary resource constraint to optional activities. Contraints\u00a010(4), 403\u2013425 (2005)","journal-title":"Contraints"},{"key":"47_CR31","unstructured":"Walsh, T.: Search in a small world. In: Proceedings of Artificial intelligence \u2013 IJCAI 1999, pp. 1172\u20131177. Morgan Kaufmann (1999)"},{"issue":"2","key":"47_CR32","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.cie.2013.02.022","volume":"65","author":"Y. Yuan","year":"2013","unstructured":"Yuan, Y., Xu, H.: Flexible job shop scheduling using hybrid differential evolution algorithms. Computers & Industrial Engineering\u00a065(2), 246\u2013260 (2013)","journal-title":"Computers & Industrial Engineering"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40627-0_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T02:02:27Z","timestamp":1558058547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40627-0_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406263","9783642406270"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40627-0_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}