{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T08:08:38Z","timestamp":1780474118155,"version":"3.54.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T00:00:00Z","timestamp":1277251200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s00291-010-0219-y","type":"journal-article","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T11:01:13Z","timestamp":1277204473000},"page":"43-68","source":"Crossref","is-referenced-by-count":8,"title":["On bilevel machine scheduling problems"],"prefix":"10.1007","volume":"34","author":[{"given":"Tam\u00e1s","family":"Kis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andr\u00e1s","family":"Kov\u00e1cs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,6,23]]},"reference":[{"key":"219_CR1","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52: 229\u2013242","journal-title":"Oper Res"},{"key":"219_CR2","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker P (2007) Scheduling algorithms, 5th edn. Springer, Berlin","edition":"5"},{"key":"219_CR3","doi-asserted-by":"crossref","unstructured":"Cardinal J, Demaine ED, Fiorini S, Joret G, Langerman S, Newman I, Weimann O (2009) The Stackelberg minimum spanning tree game. Algorithmica (in press)","DOI":"10.1007\/s00453-009-9299-y"},{"key":"219_CR4","doi-asserted-by":"crossref","unstructured":"Chen B, Potts CN, W\u00f6ginger GJ (1998) A review of machine scheduling: Complexity, algorithms and approximability. In: Du D-Z, Pardalos P (eds) Handbook of Combinatorial Optimization. Kluwer, Dordrecht","DOI":"10.1007\/978-1-4613-0303-9_25"},{"key":"219_CR5","first-page":"93","volume":"8","author":"S Dempe","year":"2000","unstructured":"Dempe S, Richter K (2000) Bilevel programming with knapsack constraints. Cent Eur J Oper Res 8: 93\u2013107","journal-title":"Cent Eur J Oper Res"},{"key":"219_CR6","volume-title":"Foundations of Bilevel Programming","author":"S Dempe","year":"2002","unstructured":"Dempe S (2002) Foundations of Bilevel Programming. Kluwer, Dordrecht"},{"key":"219_CR7","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1080\/0233193031000149894","volume":"52","author":"S Dempe","year":"2003","unstructured":"Dempe S (2003) Annotated bibliography on bilevel programming and mathematical programming with equilibrium constraints. Optimization 52: 333\u2013359","journal-title":"Optimization"},{"key":"219_CR8","unstructured":"DeNegre ST, Ralphs TK (2009) A branch-and-cut algorithms for integer bilevel programs. In: Chinneck JW, Kristjansson B, Saltzman M (eds) Operations Research and cyber-infrastructure. Springer, Berlin, pp 65\u201378"},{"key":"219_CR9","first-page":"287","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann Oper Res 5: 287\u2013326","journal-title":"Ann Oper Res"},{"key":"219_CR10","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1016\/S0098-1354(02)00100-X","volume":"26","author":"I Harjunkoski","year":"2002","unstructured":"Harjunkoski I, Grossmann IE (2002) Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Comput Chem Eng 26: 1533\u20131552","journal-title":"Comput Chem Eng"},{"key":"219_CR11","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.ejor.2004.07.011","volume":"167","author":"H Hoogeveen","year":"2005","unstructured":"Hoogeveen H (2005) Multicriteria scheduling. Eur J Oper Res 167: 592\u2013623","journal-title":"Eur J Oper Res"},{"key":"219_CR12","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0305-0548(95)00034-8","volume":"23","author":"JK Karlof","year":"1996","unstructured":"Karlof JK, Wang W (1996) Bilevel programming applied to the flowshop scheduling problem. Comput Oper Res 23: 443\u2013451","journal-title":"Comput Oper Res"},{"key":"219_CR13","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of Computer Computations. Plenum Press, New York"},{"key":"219_CR14","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1287\/mnsc.38.8.1201","volume":"38","author":"JB Lasserre","year":"1992","unstructured":"Lasserre JB (1992) An integrated model for job-shop planning and scheduling. Manage Sci 38: 1201\u20131211","journal-title":"Manage Sci"},{"key":"219_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"EL Lawler","year":"1969","unstructured":"Lawler EL, Moore JM (1969) A functional equation and its application to resource allocation and sequencing problems. Manage Sci 16: 77\u201384","journal-title":"Manage Sci"},{"key":"219_CR16","doi-asserted-by":"crossref","first-page":"1504","DOI":"10.1016\/j.ejor.2006.09.029","volume":"187","author":"Z Lukac\u0306","year":"2008","unstructured":"Lukac\u0306 Z, S\u0306ori\u0107 K, Rosenzweig V (2008) Production planning problem with sequence dependent setups as a bilevel programming problem. Eur J Oper Res 187: 1504\u20131512","journal-title":"Eur J Oper Res"},{"key":"219_CR17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/0-387-25592-3_7","volume-title":"Graph Theory and Combinatorial Optimization","author":"P Marcotte","year":"2005","unstructured":"Marcotte P, Savard G (2005) Bilevel programming: a combinatorial perspective. In: Avis D, Hertz A, Marcotte O (eds) Graph Theory and Combinatorial Optimization. Springer, Berlin, pp 191\u2013218"},{"key":"219_CR18","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"JM Moore","year":"1968","unstructured":"Moore JM (1968) An n job, one machine sequencing algorithm for minimizing the number of late jobs. Manage Sci 15: 102\u2013109","journal-title":"Manage Sci"},{"key":"219_CR19","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N Nisan","year":"2001","unstructured":"Nisan N, Ronen A (2001) Algorithmic mechanism design. Games Econ Behav 35: 166\u2013196","journal-title":"Games Econ Behav"},{"key":"219_CR20","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"SK Sahni","year":"1976","unstructured":"Sahni SK (1976) Algorithms for scheduling independent tasks. J ACM 23: 116\u2013127","journal-title":"J ACM"},{"key":"219_CR21","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"\u00c9 Tardos","year":"1986","unstructured":"Tardos \u00c9 (1986) A strongly polynomial algorithm for solving combinatorial linear programs. Oper Res 34: 250\u2013256","journal-title":"Oper Res"},{"key":"219_CR22","unstructured":"Schuurman P, W\u00f6ginger GJ (2001) Approximation Schemes\u2014A Tutorial. Research Report Woe-65, CS Department, TU Graz, Austria"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-010-0219-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-010-0219-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-010-0219-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T05:18:07Z","timestamp":1559193487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-010-0219-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,23]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["219"],"URL":"https:\/\/doi.org\/10.1007\/s00291-010-0219-y","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,23]]}}}