{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T12:00:17Z","timestamp":1775908817195,"version":"3.50.1"},"reference-count":81,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,9,27]],"date-time":"2011-09-27T00:00:00Z","timestamp":1317081600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10288-011-0180-x","type":"journal-article","created":{"date-parts":[[2011,9,26]],"date-time":"2011-09-26T09:48:32Z","timestamp":1317030512000},"page":"111-161","source":"Crossref","is-referenced-by-count":25,"title":["The symmetric quadratic knapsack problem: approximation and scheduling applications"],"prefix":"10.1007","volume":"10","author":[{"given":"Hans","family":"Kellerer","sequence":"first","affiliation":[]},{"given":"Vitaly A.","family":"Strusevich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,9,27]]},"reference":[{"key":"180_CR1","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/BF00288977","volume":"26","author":"I Adiri","year":"1989","unstructured":"Adiri I, Bruno J, Frostig E, Rinnooy Kan AHG (1989) Single machine flow-time scheduling with a single breakdown. Acta Inform 26: 679\u2013696","journal-title":"Acta Inform"},{"key":"180_CR2","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":"180_CR3","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1287\/moor.23.3.649","volume":"33","author":"T Badics","year":"1998","unstructured":"Badics T, Boros E (1998) Minimization of half-products. Math Oper Res 33: 649\u2013660","journal-title":"Math Oper Res"},{"key":"180_CR4","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1287\/mnsc.33.7.894","volume":"33","author":"U Bagchi","year":"1987","unstructured":"Bagchi U, Sullivan RS, Chang Y-L (1987) Minimizing mean squared deviation of completion times about a common due date. Manag Sci 33: 894\u2013906","journal-title":"Manag Sci"},{"key":"180_CR5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1142\/9789814354363_0003","volume-title":"Complexity in numerical optimization","author":"P Berman","year":"1993","unstructured":"Berman P, Kovoor N, Pardalos PM (1993) Algorithms for the least distance problem. In: Pardalos PM (eds) Complexity in numerical optimization. World Scientific, Singapore, pp 33\u201356"},{"key":"180_CR6","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1016\/j.ejor.2006.10.005","volume":"183","author":"J Breit","year":"2007","unstructured":"Breit J (2007) Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint. Europ J Oper Res 183: 516\u2013524","journal-title":"Europ J Oper Res"},{"key":"180_CR7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0167-6377(96)00039-9","volume":"20","author":"KM Bretthauer","year":"1997","unstructured":"Bretthauer KM, Shetty B (1997) Quadratic resource allocation with generalized upper bounds. Oper Res Lett 20: 51\u201357","journal-title":"Oper Res Lett"},{"key":"180_CR8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0167-6377(84)90010-5","volume":"3","author":"P Brucker","year":"1984","unstructured":"Brucker P (1984) An O(n) algorithm for quadratic knapsack problems. Oper Res Lett 3: 163\u2013166","journal-title":"Oper Res Lett"},{"key":"180_CR9","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/0377-2217(93)E0367-7","volume":"85","author":"X Cai","year":"1995","unstructured":"Cai X (1995) Minimization of agreeably weighted variance in single machine systems. Europ J Oper Res 85: 576\u2013592","journal-title":"Europ J Oper Res"},{"key":"180_CR10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.ejor.2003.10.045","volume":"162","author":"J Cheng","year":"2005","unstructured":"Cheng J, Kubiak W (2005) A half-product based approximation scheme for agreeably weighted completion time variance. Europ J Oper Res 162: 45\u201354","journal-title":"Europ J Oper Res"},{"key":"180_CR11","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1287\/mnsc.35.9.1143","volume":"35","author":"P De","year":"1989","unstructured":"De P, Ghosh JB, Wells CE (1989) A note on the minimization of mean squared deviation of completion times about a common due date. Manag Sci 35: 1143\u20131147","journal-title":"Manag Sci"},{"key":"180_CR12","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1287\/opre.40.6.1148","volume":"40","author":"P De","year":"1992","unstructured":"De P, Ghosh JB, Wells CE (1992) On the minimization of completion time variance with bicriteria extension. Oper Res 40: 1148\u20131155","journal-title":"Oper Res"},{"key":"180_CR13","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1287\/mnsc.23.6.567","volume":"23","author":"S Eilon","year":"1972","unstructured":"Eilon S, Chowdhury IE (1972) Minimizing time variance in the single machine problem. Manag Sci 23: 567\u2013575","journal-title":"Manag Sci"},{"key":"180_CR14","doi-asserted-by":"crossref","unstructured":"Epstein L, Levin A, Marchetti-Spaccamela A, Megow N, Mestre J, Skutella M, Stogie L (2010) Universal sequencing on a single machine. In: Eisenbrand F, Shepherd B (eds) IPCO 2010, Lect Notes Comp Sci 6080:230\u2013243","DOI":"10.1007\/978-3-642-13036-6_18"},{"key":"180_CR15","doi-asserted-by":"crossref","first-page":"3046","DOI":"10.1016\/j.dam.2008.01.018","volume":"156","author":"E Erel","year":"2008","unstructured":"Erel E, Ghosh JB (2008) FPTAS for half-products minimization with scheduling applications. Discr Appl Math 156: 3046\u20133056","journal-title":"Discr Appl Math"},{"key":"180_CR16","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1080\/07408179008964176","volume":"22","author":"Y Fathi","year":"1990","unstructured":"Fathi Y, Nuttle HWL (1990) Heuristics for the common due date weighted tardiness problem. IIE Trans 22: 215\u2013225","journal-title":"IIE Trans"},{"key":"180_CR17","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10951-008-0064-x","volume":"11","author":"VS Gordon","year":"2008","unstructured":"Gordon VS, Potts CN, Strusevich VA, Whitehead JD (2008) Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. J Sched 11: 357\u2013370","journal-title":"J Sched"},{"key":"180_CR18","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.39.5.836","volume":"39","author":"NG Hall","year":"1991","unstructured":"Hall NG, Posner ME (1991) Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date. Oper Res 39: 836\u2013846","journal-title":"Oper Res"},{"key":"180_CR19","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1287\/opre.39.5.847","volume":"39","author":"NG Hall","year":"1991","unstructured":"Hall NG, Kubiak W, Sethi SP (1991) Earliness-tardiness scheduling problems, II: deviation of completion times about a restrictive common due date. Oper Res 39: 847\u2013856","journal-title":"Oper Res"},{"key":"180_CR20","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10288-005-0078-6","volume":"3","author":"DS Hochbaum","year":"2005","unstructured":"Hochbaum DS (2005) Complexity and algorithms for convex network optimization and other nonlinear problems. 4OR Q J Oper Res 3: 171\u2013216","journal-title":"4OR Q J Oper Res"},{"key":"180_CR21","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1145\/96559.96597","volume":"37","author":"DS Hochbaum","year":"1990","unstructured":"Hochbaum DS, Shantikumar JG (1990) Convex separable optimization is not much harder than linear optimization. J ACM 37: 843\u2013862","journal-title":"J ACM"},{"key":"180_CR22","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/opre.42.1.102","volume":"42","author":"JA Hoogeveen","year":"1994","unstructured":"Hoogeveen JA, Oosterhout H, van de Velde SL (1994) New lower and upper bounds for scheduling around a small common due date. Oper Res 42: 102\u2013110","journal-title":"Oper Res"},{"key":"180_CR23","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0377-2217(91)90228-N","volume":"55","author":"JA Hoogeveen","year":"1991","unstructured":"Hoogeveen JA, van de Velde SL (1991) Scheduling around a small common due date. Europ J Oper Res 55: 237\u2013242","journal-title":"Europ J Oper Res"},{"key":"180_CR24","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s00607-001-1441-x","volume":"68","author":"H Hoogeveen","year":"2002","unstructured":"Hoogeveen H, Woeginger GJ (2002) Some comments on sequencing with controllable processing times. Computing 68: 181\u2013192","journal-title":"Computing"},{"key":"180_CR25","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1016\/j.ejor.2004.04.012","volume":"165","author":"A Janiak","year":"2005","unstructured":"Janiak A, Kovalyov MY, Kubiak W, Werner F (2005) Positive half-products and scheduling with controllable processing times. Europ J Oper Res 165: 416\u2013422","journal-title":"Europ J Oper Res"},{"key":"180_CR26","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0166-218X(96)00040-6","volume":"72","author":"B Jurisch","year":"1997","unstructured":"Jurisch B, Kubiak W, J\u00f3zefowska J (1997) Algorithms for minclique scheduling problems. Discr Appl Math 72: 115\u2013139","journal-title":"Discr Appl Math"},{"key":"180_CR27","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.cie.2007.08.005","volume":"54","author":"I Kacem","year":"2008","unstructured":"Kacem I (2008) Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Comp Industr Eng 54: 401\u2013410","journal-title":"Comp Industr Eng"},{"key":"180_CR28","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1016\/j.dam.2010.01.013","volume":"158","author":"I Kacem","year":"2010","unstructured":"Kacem I (2010) Fully polynomial-time approximation scheme for the weighted total tardiness minimization with a common due date. Discr Appl Math 158: 1035\u20131040","journal-title":"Discr Appl Math"},{"key":"180_CR29","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1016\/j.ejor.2006.06.062","volume":"187","author":"I Kacem","year":"2008","unstructured":"Kacem I, Chu C (2008) Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period. Europ J Oper Res 187: 1080\u20131089","journal-title":"Europ J Oper Res"},{"key":"180_CR30","doi-asserted-by":"crossref","unstructured":"Kacem I, Mahjoub AR (2009) Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Comp Industr Eng 56: 1708\u20131712 (see also Erratum: Kacem I (2011) to be published in Comp Industr Eng)","DOI":"10.1016\/j.cie.2008.09.042"},{"key":"180_CR31","doi-asserted-by":"crossref","first-page":"1453","DOI":"10.1287\/mnsc.27.12.1453","volume":"27","author":"JT Kanet","year":"1981","unstructured":"Kanet JT (1981) Minimizing variation of flow time in single machine systems. Manag Sci 27: 1453\u20131459","journal-title":"Manag Sci"},{"key":"180_CR32","doi-asserted-by":"crossref","unstructured":"Karakostas G, Kolliopoulos SG, Wang J (2009) An FPTAS for the total weighted tardiness problem with a fixed number of distinct due dates. In: Proceedings of the 15th annual international computing and combinatorics conference (COCOON), Lect Notes Comput Sci 5609:238\u2013248","DOI":"10.1007\/978-3-642-02882-3_24"},{"key":"180_CR33","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.ejor.2008.11.003","volume":"199","author":"H Kellerer","year":"2009","unstructured":"Kellerer H, Kubzin MA, Strusevich VA (2009) Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval. Europ J Oper Res 199: 111\u2013116","journal-title":"Europ J Oper Res"},{"key":"180_CR34","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0022-0000(03)00006-0","volume":"66","author":"H Kellerer","year":"2003","unstructured":"Kellerer H, Mansini R, Pferschy U, Speranza MG (2003) An efficient fully polynomial approximation scheme for the Subset-Sum Problem. J Comput Syst Sci 66: 349\u2013370","journal-title":"J Comput Syst Sci"},{"key":"180_CR35","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1009813105532","volume":"3","author":"H Kellerer","year":"1999","unstructured":"Kellerer H, Pferschy U (1999) A new fully polynomial time approximation scheme for the knapsack problem. J Combin Optimiz 3: 59\u201371","journal-title":"J Combin Optimiz"},{"key":"180_CR36","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/B:JOCO.0000021934.29833.6b","volume":"8","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U (2004) Improved dynamic programming in connection with an FPTAS for the knapsack problem. J Combin Optimiz 8: 5\u201311","journal-title":"J Combin Optimiz"},{"key":"180_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin"},{"key":"180_CR38","unstructured":"Kellerer H, Rustogi K, Strusevich VA (2011) Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance. Report SORG-02-2011"},{"key":"180_CR39","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.tcs.2006.08.030","volume":"369","author":"H Kellerer","year":"2006","unstructured":"Kellerer H, Strusevich VA (2006) A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theor Comp Sci 369: 230\u2013238","journal-title":"Theor Comp Sci"},{"key":"180_CR40","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1007\/s00453-008-9248-1","volume":"57","author":"H Kellerer","year":"2010","unstructured":"Kellerer H, Strusevich VA (2010) Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica 57: 769\u2013795","journal-title":"Algorithmica"},{"key":"180_CR41","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1142\/S0129054110007301","volume":"21","author":"H Kellerer","year":"2010","unstructured":"Kellerer H, Strusevich VA (2010) Minimizing total weighted earliness-tardiness on a single machine around a small common due date: An FPTAS using quadratic knapsack. Int J Found Comp Sci 21: 357\u2013383","journal-title":"Int J Found Comp Sci"},{"key":"180_CR42","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.tcs.2005.11.039","volume":"355","author":"SV Kolliopoulos","year":"2006","unstructured":"Kolliopoulos SV, Steiner G (2006) Approximation algorithms for minimizing the total weighted tardiness on a single machine. Theor Comput Sci 355: 261\u2013273","journal-title":"Theor Comput Sci"},{"key":"180_CR43","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1287\/opre.47.5.757","volume":"47","author":"MY Kovalyov","year":"1999","unstructured":"Kovalyov MY, Kubiak W (1999) A fully polynomial approximation scheme for the weighted earliness-tardiness problem. Oper Res 47: 757\u2013761","journal-title":"Oper Res"},{"key":"180_CR44","first-page":"1108","volume":"20","author":"MK Kozlov","year":"1979","unstructured":"Kozlov MK, Tarasov SP, Ha\u010dijan LG (1979) Polynomial solvability of convex quadratic programming. Sov Math Doklady 20: 1108\u20131111","journal-title":"Sov Math Doklady"},{"key":"180_CR45","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-6377(93)90019-D","volume":"14","author":"W Kubiak","year":"1993","unstructured":"Kubiak W (1993) Completion time variance on a single machine is difficult. Oper Res Lett 14: 49\u201359","journal-title":"Oper Res Lett"},{"key":"180_CR46","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(93)E0125-I","volume":"58","author":"W Kubiak","year":"1995","unstructured":"Kubiak W (1995) New results on the completion time variance minimization. Discr Appl Math 58: 157\u2013168","journal-title":"Discr Appl Math"},{"key":"180_CR47","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.dam.2004.07.007","volume":"146","author":"W Kubiak","year":"2005","unstructured":"Kubiak W (2005) Minimization of ordered, symmetric half-products. Discr Appl Math 146: 287\u2013300","journal-title":"Discr Appl Math"},{"key":"180_CR48","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0377-2217(01)00211-9","volume":"137","author":"W Kubiak","year":"2002","unstructured":"Kubiak W, Cheng J, Kovalyov MY (2002) Fast fully polynomial approximation schemes for minimizing completion time variance. Europ J Oper Res 137: 303\u2013309","journal-title":"Europ J Oper Res"},{"key":"180_CR49","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10288-005-0070-1","volume":"3","author":"MA Kubzin","year":"2005","unstructured":"Kubzin MA, Strusevich VA (2005) Two-machine flow shop no-wait scheduling with machine maintenance. 4OR \u2013 Q J Oper Res 3: 303\u2013313","journal-title":"4OR \u2013 Q J Oper Res"},{"key":"180_CR50","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/opre.1060.0301","volume":"54","author":"MA Kubzin","year":"2006","unstructured":"Kubzin MA, Strusevich VA (2006) Planning machine maintenance in two-machine shop scheduling. Oper Res 54: 789\u2013800","journal-title":"Oper Res"},{"key":"180_CR51","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.ipl.2005.09.007","volume":"97","author":"W-H Kuo","year":"2006","unstructured":"Kuo W-H, Yang D-L (2006) Minimizing the makespan in a single machine scheduling problem with a time-based learning effect. Inform Proc Lett 97: 64\u201367","journal-title":"Inform Proc Lett"},{"key":"180_CR52","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. Manag Sci 16: 77\u201384","journal-title":"Manag Sci"},{"key":"180_CR53","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF00121681","volume":"9","author":"C-Y Lee","year":"1996","unstructured":"Lee C-Y (1996) Machine scheduling with an availability constraint. J Glob Optimiz 9: 395\u2013416","journal-title":"J Glob Optimiz"},{"key":"180_CR54","first-page":"22-1","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"C-Y Lee","year":"2004","unstructured":"Lee C-Y (2004) Machine scheduling with availability constraints. In: Leung JY-T (eds) Handbook of scheduling: algorithms, models and performance analysis. Chapman and Hall\/CRC, London, pp 22-1\u201322-13"},{"key":"180_CR55","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF01178778","volume":"29","author":"C-Y Lee","year":"1992","unstructured":"Lee C-Y, Liman SD (1992) Single machine flow time scheduling with scheduled maintenance. Acta Inform 29: 375\u2013382","journal-title":"Acta Inform"},{"key":"180_CR56","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.cie.2009.04.014","volume":"58","author":"Y Ma","year":"2010","unstructured":"Ma Y, Chu C, Zuo C (2010) A survey of scheduling with deterministic machine availability constraints. Comp Industr Eng 58: 199\u2013211","journal-title":"Comp Industr Eng"},{"key":"180_CR57","unstructured":"Marchetti-Spaccamela A, Megow N, Skutella M, Stougie L (2008) Robust sequencing on a single machine. Matheon Preprint 533"},{"key":"180_CR58","volume-title":"Knapsack Problems. Algorithms and computer implementation","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack Problems. Algorithms and computer implementation. Wiley, Chichester"},{"key":"180_CR59","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/mnsc.18.9.518","volume":"18","author":"AG Merten","year":"1972","unstructured":"Merten AG, Muller ME (1972) Variance minimization in single machine sequencing problems. Manag Sci 18: 518\u2013528","journal-title":"Manag Sci"},{"key":"180_CR60","unstructured":"Megow N, Verschae J (2009) Short note on scheduling on a single machine with one non-availability period. Matheon Preprint 557"},{"key":"180_CR61","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"RDC Monteiro","year":"1989","unstructured":"Monteiro RDC, Adler I (1989) Interior path following primal-dual algorithms. Part II: convex quadratic programming. Math Progr 44: 43\u201366","journal-title":"Math Progr"},{"key":"180_CR62","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01588800","volume":"49","author":"JJ Mor\u00e9","year":"1991","unstructured":"Mor\u00e9 JJ, Vavasis SA (1991) On the solution of concave knapsack problems. Math Progr 49: 397\u2013411","journal-title":"Math Progr"},{"key":"180_CR63","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0166-218X(90)90105-L","volume":"26","author":"E Nowicki","year":"1990","unstructured":"Nowicki E, Zdrza\u0142ka S (1990) A survey of results for sequencing problems with controllable processing times. Discr Appl Math 26: 271\u2013287","journal-title":"Discr Appl Math"},{"key":"180_CR64","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.dam.2006.08.007","volume":"155","author":"D Pisinger","year":"2007","unstructured":"Pisinger D (2007) The quadratic knapsack problem\u2014a survey. Discr Appl Math 155: 623\u2013648","journal-title":"Discr Appl Math"},{"key":"180_CR65","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0167-6377(02)00122-0","volume":"30","author":"DJ Jr. Rader","year":"2002","unstructured":"Rader DJ Jr., Woeginger GJ (2002) The quadratic 0\u20131 knapsack problem with series\u2013parallel support. Oper Res Lett 30: 159\u2013166","journal-title":"Oper Res Lett"},{"key":"180_CR66","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.orl.2006.01.010","volume":"35","author":"HE Romeijn","year":"2007","unstructured":"Romeijn HE, Geunes G, Taafe K (2007) On a nonseparable convex maximization problem with continuous knapsack constraints. Oper Res Lett 35: 172\u2013180","journal-title":"Oper Res Lett"},{"key":"180_CR67","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.ejor.2003.08.026","volume":"161","author":"C Sadfi","year":"2005","unstructured":"Sadfi C, Penz B, Rapin C, B\u0142a\u017eewicz J, Formanowicz P (2005) An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. Europ J Oper Res 161: 3\u201310","journal-title":"Europ J Oper Res"},{"key":"180_CR68","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":"180_CR69","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discr Appl Math 155: 1643\u20131666","journal-title":"Discr Appl Math"},{"key":"180_CR70","doi-asserted-by":"crossref","first-page":"2178","DOI":"10.1016\/j.dam.2005.04.014","volume":"154","author":"NV Shakhlevich","year":"2006","unstructured":"Shakhlevich NV, Strusevich VA (2006) Single machine scheduling with controllable release and processing parameters. Discr Appl Math 154: 2178\u20132199","journal-title":"Discr Appl Math"},{"key":"180_CR71","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/375827.375840","volume":"48","author":"M Skutella","year":"2001","unstructured":"Skutella M (2001) Convex quadratic and semidefinite programming relaxations in scheduling. J ACM 48: 206\u2013242","journal-title":"J ACM"},{"key":"180_CR72","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith WE (1956) Various optimizers for single stage production. Naval Res Logist Quart 3: 59\u201366","journal-title":"Naval Res Logist Quart"},{"key":"180_CR73","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01581240","volume":"59","author":"A Tamir","year":"1993","unstructured":"Tamir A (1993) A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks. Math Progr 59: 117\u2013132","journal-title":"Math Progr"},{"key":"180_CR74","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1080\/05695558008974515","volume":"12","author":"RG Vickson","year":"1980","unstructured":"Vickson RG (1980) Two single machine sequencing problems involving controllable job processing time. AIIE Trans 12: 258\u2013262","journal-title":"AIIE Trans"},{"key":"180_CR75","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0020-0190(01)00143-0","volume":"79","author":"G Wan","year":"2001","unstructured":"Wan G, Yen BP-C, Li C-L (2001) Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. Inform Proc Lett 79: 273\u2013280","journal-title":"Inform Proc Lett"},{"key":"180_CR76","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10479-004-5032-z","volume":"133","author":"G Wang","year":"2005","unstructured":"Wang G, Sun H, Chu C (2005) Preemptive scheduling with availability constraints to minimize total weighted completion times. Ann Oper Res 133: 183\u2013192","journal-title":"Ann Oper Res"},{"key":"180_CR77","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1287\/ijoc.11.2.211","volume":"11","author":"GJ Woeginger","year":"1999","unstructured":"Woeginger GJ (1999) An approximation scheme for minimizing agreeably weighted variance on a single machine. INFORMS J Comput 11: 211\u2013216","journal-title":"INFORMS J Comput"},{"key":"180_CR78","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1016\/j.cie.2011.01.016","volume":"60","author":"C-C Wu","year":"2011","unstructured":"Wu C-C, Yin Y, Cheng S-R (2011) Some single-machine scheduling problems with a truncation learning effect. Comp Industr Eng 60: 790\u2013795","journal-title":"Comp Industr Eng"},{"key":"180_CR79","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/j.omega.2010.01.003","volume":"38","author":"S-J Yang","year":"2010","unstructured":"Yang S-J, Yang D-L (2010) Minimizing the makespan single-machine scheduling with aging effects and variable maintenance activities. Omega 38: 528\u2013533","journal-title":"Omega"},{"key":"180_CR80","first-page":"328","volume":"5","author":"J Yuan","year":"1992","unstructured":"Yuan J (1992) The NP-hardness of the single machine common due date weighted tardiness problem. Syst Sci Math Sci 5: 328\u2013333","journal-title":"Syst Sci Math Sci"},{"key":"180_CR81","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1016\/j.apm.2009.07.002","volume":"34","author":"C-L Zhao","year":"2010","unstructured":"Zhao C-L, Tang H-Y (2010) Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan. Appl Math Model 34: 837\u2013841","journal-title":"Appl Math Model"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-011-0180-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-011-0180-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-011-0180-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T09:33:18Z","timestamp":1560677598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-011-0180-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,27]]},"references-count":81,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["180"],"URL":"https:\/\/doi.org\/10.1007\/s10288-011-0180-x","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,27]]}}}