{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T08:27:10Z","timestamp":1780475230628,"version":"3.54.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,8,28]],"date-time":"2010-08-28T00:00:00Z","timestamp":1282953600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s10601-010-9102-3","type":"journal-article","created":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T03:20:32Z","timestamp":1282879232000},"page":"317-340","source":"Crossref","is-referenced-by-count":7,"title":["Constraint programming approach to a bilevel scheduling problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Andr\u00e1s","family":"Kov\u00e1cs","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tam\u00e1s","family":"Kis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,8,28]]},"reference":[{"key":"9102_CR1","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Le Pape, C., & Nuijten, W. (2001). Constraint-based scheduling. Kluwer.","DOI":"10.1007\/978-1-4615-1479-4"},{"key":"9102_CR2","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/0305-0483(83)90038-5","volume":"11","author":"JF Bard","year":"1983","unstructured":"Bard, J.\u00a0F. (1983). Coordination of a multidivisional organization through two levels of management. Omega, 11, 457\u2013468.","journal-title":"Omega"},{"key":"9102_CR3","unstructured":"Benedetti, M., Lallouet, A., & Vautard, J. (2007). QCSP made practical by virtue of restricted quantification. In International joint conference on artificial intelligence (pp. 38\u201343)."},{"key":"9102_CR4","doi-asserted-by":"crossref","unstructured":"Benedetti, M., Lallouet, A., & Vautard, J. (2008). Modeling adversary scheduling with QCSP+. In Proc. of the 2008 ACM symposium on applied computing (pp. 151\u2013155).","DOI":"10.1145\/1363686.1363727"},{"key":"9102_CR5","doi-asserted-by":"crossref","unstructured":"Benedetti, M., Lallouet, A., & Vautard, J. (2008). Quantified constraint optimization. In CP2008, principles and practice of constraint programming. LNCS (Vol. 5202, pp. 463\u2013477). Springer.","DOI":"10.1007\/978-3-540-85958-1_31"},{"key":"9102_CR6","doi-asserted-by":"crossref","unstructured":"Brown, G.\u00a0G., Carlyle, W.\u00a0M., Royset, J., & Wood, R.\u00a0K. (2005). On the complexity of delaying an adversary\u2019s project. In Operations research\/computer science interfaces (Vol.\u00a029, Chapter\u00a01). Springer.","DOI":"10.1007\/0-387-23529-9_1"},{"key":"9102_CR7","unstructured":"Brown, K. N., Little, J., Creed, P.\u00a0J., & Freuder, E.\u00a0C. (2004). Adversarial constraint satisfaction by game-tree search. In Proc. of ECAI 2004 (pp. 151\u2013155)."},{"issue":"1","key":"9102_CR8","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0098-1354(90)87007-C","volume":"14","author":"PA Clark","year":"1990","unstructured":"Clark, P. A., & Westerberg, A. (1990). Bilevel programming for steady-state chemical process design. I: Fundamentals and algorithms. Computers and Chemical Engineering, 14(1), 87\u201397.","journal-title":"Computers and Chemical Engineering"},{"issue":"3","key":"9102_CR9","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/nav.10056","volume":"50","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"2003","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., & Sevaux, M. (2003). Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine. Naval Research Logistics, 50(3), 273\u2013288.","journal-title":"Naval Research Logistics"},{"key":"9102_CR10","unstructured":"Dempe, S. (2001). Discrete bilevel optimization problems. Technical report, Universit\u00e4t Leipzig."},{"key":"9102_CR11","unstructured":"Dempe, S. (2002). Foundations of bilevel programming. Kluwer."},{"issue":"8","key":"9102_CR12","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1080\/02331930701763389","volume":"58","author":"D Fangh\u00e4nel","year":"2009","unstructured":"Fangh\u00e4nel, D., & Dempe, S. (2009). Bilevel programming with discrete lower level problems. Optimization: A Journal of Mathematical Programming and Operations Research, 58(8), 1029\u20131047.","journal-title":"Optimization: A Journal of Mathematical Programming and Operations Research"},{"key":"9102_CR13","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability\u2014A guide to the theory of NP-completeness. Freeman."},{"key":"9102_CR14","unstructured":"Gecode (2009). Generic constraint development environment, version 3.1. http:\/\/www.gecode.org\/ ."},{"key":"9102_CR15","unstructured":"Gent, I., Nightingale, P., & Stergiou, K. (2005). QCSP-Solve: A solver for quantified constraint satisfaction problems. In Proceedings of IJCAI-2005 (pp. 138\u2013143)."},{"key":"9102_CR16","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1016\/j.artint.2007.11.003","volume":"172","author":"IP Gent","year":"2008","unstructured":"Gent, I. P., Nightingale, P., Rowley, A., & Stergiou, K. (2008). Solving quantified constraint satisfaction problems. Artificial Intelligence, 172, 738\u2013771.","journal-title":"Artificial Intelligence"},{"key":"9102_CR17","first-page":"287","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J.\u00a0K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Operations Research, 5, 287\u2013326.","journal-title":"Annals of Operations Research"},{"key":"9102_CR18","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"JN Hooker","year":"2003","unstructured":"Hooker, J. N., & Ottosson, G. (2003). Logic-based benders decomposition. Mathematical Programming, 96, 33\u201360.","journal-title":"Mathematical Programming"},{"key":"9102_CR19","unstructured":"Jouglet, A., Baptiste, P., & Carlier, J. (2004). Branch-and-bound algorithms for total weighted tardiness. In Handbook of scheduling: Algorithms, models, and performance analysis (Chapter\u00a013). Chapman & Hall\/CRC."},{"key":"9102_CR20","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/j.ejor.2006.11.036","volume":"184","author":"A Jouglet","year":"2008","unstructured":"Jouglet, A., Savourey, D., Carlier, J., & Baptiste, P. (2008). Dominance-based heuristics for one-machine total cost scheduling problems. European Journal of Operational Research, 184, 879\u2013899.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"9102_CR21","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0305-0548(95)00034-8","volume":"23","author":"JK Karlof","year":"1996","unstructured":"Karlof, J. K., & Wang, W. (1996). Bilevel programming applied to the flow shop scheduling problem. Computers and Operations Research, 23(5), 443\u2013451.","journal-title":"Computers and Operations Research"},{"key":"9102_CR22","author":"T Kis","year":"2009","unstructured":"Kis, T., & Kov\u00e1cs, A. (2009). On bilevel machine scheduling problems. OR Spektrum, in print. doi: 10.1007\/s00291-010-0219-y .","journal-title":"OR Spektrum"},{"issue":"12","key":"9102_CR23","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1287\/mnsc.44.12.1608","volume":"44","author":"M Labb\u00e9","year":"1998","unstructured":"Labb\u00e9, M., Marcotte, P., & Savard, G. (1998). A bilevel model of taxation and its application to optimal highway pricing. Management Science, 44(12), 1608\u20131622.","journal-title":"Management Science"},{"key":"9102_CR24","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"key":"9102_CR25","doi-asserted-by":"crossref","first-page":"1504","DOI":"10.1016\/j.ejor.2006.09.029","volume":"187","author":"Z Luka\u010d","year":"2008","unstructured":"Luka\u010d, Z., \u0160ori\u0107, K., & Vojvodi\u0107 Rosenzweig, V. (2008). Production planning problem with sequence dependent setups as a bilevel programming problem. European Journal of Operational Research, 187, 1504\u20131512.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"9102_CR26","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1287\/trsc.1080.0236","volume":"43","author":"P Marcotte","year":"2009","unstructured":"Marcotte, P., Mercier, A., Savard, G., & Verter, V. (2009). Toll policies for mitigating hazardous materials transport risk. Transportation Science, 43(2), 228\u2013243.","journal-title":"Transportation Science"},{"key":"9102_CR27","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/j.ejor.2005.08.013","volume":"176","author":"R M\u2019Hallah","year":"2007","unstructured":"M\u2019Hallah, R., & Bulfin, R. L. (2007). Minimizing the weighted number of tardy jobs on a single machine with release dates. European Journal of Operational Research, 176, 727\u2013744.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"9102_CR28","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s10601-009-9068-1","volume":"14","author":"P Nightingale","year":"2009","unstructured":"Nightingale, P. (2009). Non-binary quantified CSP: Algorithms and modelling. Constraints, 14(4), 539\u2013581.","journal-title":"Constraints"},{"issue":"4","key":"9102_CR29","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TASE.2005.853474","volume":"2","author":"Y Pan","year":"2005","unstructured":"Pan, Y., & Shi, L. (2005). Dual constrained single machine sequencing to minimize total weighted completion time. IEEE Transactions on Automation Science and Engineering, 2(4), 344\u2013357.","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"9102_CR30","doi-asserted-by":"crossref","unstructured":"Pr\u00e9kopa, A. (1995). Stochastic programming. Kluwer.","DOI":"10.1007\/978-94-017-3087-7"},{"key":"9102_CR31","unstructured":"QeCode (2009). An open QCSP solver, version 2.0. www.univ-orleans.fr\/lifo\/members\/vautard\/qecode ."},{"key":"9102_CR32","unstructured":"Rossi, F., van Beek, P., & Walsh, T. (Eds.) (2006). Handbook of constraint programming. Elsevier."},{"key":"9102_CR33","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/opre.31.2.253","volume":"31","author":"HD Sherali","year":"1983","unstructured":"Sherali, H. D., Soyster, A. L., & Murphy, F. H. (1983). Stackelberg-Nash-Cournot equilibria: Characterizations and computations. Operations Research, 31, 253\u2013276.","journal-title":"Operations Research"},{"key":"9102_CR34","volume-title":"Marktform and gleichgewicht","author":"H Stackelberg","year":"1934","unstructured":"Stackelberg, H. (1934). Marktform and gleichgewicht. Vienna: Julius Springer."},{"key":"9102_CR35","doi-asserted-by":"crossref","unstructured":"Tsoukalas, A., Wiesemann, W., & Rustem, B. (2009). Global optimisation of pessimistic bi-level problems. In P. M. Pardalos, & T.\u00a0F. Coleman (Eds.), Lectures on global optimization (pp. 215\u2013243). American Mathematical Society.","DOI":"10.1090\/fic\/055\/10"},{"key":"9102_CR36","doi-asserted-by":"crossref","unstructured":"Verger, G., & Bessi\u00e8re, C. (2006). Blocksolve: a bottom-up approach for solving quantified CSPs. In CP2006, principles and practice of constraint programming. LNCS (Vol. 4204, pp. 635\u2013649). Springer.","DOI":"10.1007\/11889205_45"},{"key":"9102_CR37","doi-asserted-by":"crossref","unstructured":"von Stengel, B. (2007). Equilibrium computation for two-player games in strategic and extensive form. In N. Nisan, T.\u00a0Roughgarden, \u00c9. Tardos, & V. V. Vazirani (Eds.), Algorithmic game theory (Chapter\u00a03). Cambridge University Press.","DOI":"10.1017\/CBO9780511800481.005"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-010-9102-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-010-9102-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-010-9102-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:47:35Z","timestamp":1559468855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-010-9102-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,28]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9102"],"URL":"https:\/\/doi.org\/10.1007\/s10601-010-9102-3","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,28]]}}}