{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:22:20Z","timestamp":1759335740604},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1007\/bf02522821","type":"journal-article","created":{"date-parts":[[2006,11,7]],"date-time":"2006-11-07T23:40:51Z","timestamp":1162942851000},"page":"100-110","source":"Crossref","is-referenced-by-count":5,"title":["Using quadratic programming to solve high multiplicity scheduling problems on parallel machines"],"prefix":"10.1007","volume":"17","author":[{"given":"F.","family":"Granot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Skorin-Kapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Tamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02522821_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A. V., J. E. Hopcroft, and J. D. Ullman. 1974.The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA."},{"issue":"3","key":"BF02522821_CR2","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 Algorithm for Quadratic Knapsack Problems.Operations Research Letters 3(3), 163\u2013166.","journal-title":"Operations Research Letters"},{"key":"BF02522821_CR3","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/361011.361064","volume":"17","author":"J. L. Bruno","year":"1974","unstructured":"Bruno, J. L., E. G. Coffman, Jr., and R. Sethi. 1974. Scheduling Independent Tasks to Reduce Mean Finishing Time,Communications of the ACM 17, 382\u2013387.","journal-title":"Communications of the ACM"},{"key":"BF02522821_CR4","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1137\/0215009","volume":"15","author":"Z. Galal","year":"1986","unstructured":"Galal, Z., S. Macali, and H. Gabow. 1986. Priority Queues with Variable Priority and anO(EV logV) Algorithm for Finding a Maximal Weighted Matching in General Graphs,SIAM Journal on Computing 15, 120\u2013130.","journal-title":"SIAM Journal on Computing"},{"key":"BF02522821_CR5","volume-title":"Computers and Intractability: a Guide to the Theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., and D. S. Johnson. 1979.Computers and Intractability: a Guide to the Theory of NP-completeness, Freeman, San Francisco, CA."},{"key":"BF02522821_CR6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0166-218X(93)90034-L","volume":"41","author":"F. Granot","year":"1993","unstructured":"Granot, F., and J. Skorin-Kapov. 1993. On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem,Discrete Applied Mathematics 41, 139\u2013146.","journal-title":"Discrete Applied Mathematics"},{"key":"BF02522821_CR7","series-title":"Working Paper","volume-title":"On Solvability of High Multiplicity Scheduling Problems on Parallel Machines","author":"F. Granot","year":"1994","unstructured":"Granot, F., J. Skorin-Kapov, and A. Tamir. 1994. On Solvability of High Multiplicity Scheduling Problems on Parallel Machines, Working Paper, SUNY, Stony Brook, NY."},{"key":"BF02522821_CR8","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1287\/opre.39.4.648","volume":"39","author":"D. S. Hochbaum","year":"1991","unstructured":"Hochbaum, D. S., and R. Shamir. 1991. Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem,Operations Research 39, 648\u2013653.","journal-title":"Operations Research"},{"issue":"4","key":"BF02522821_CR9","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1145\/96559.96597","volume":"37","author":"D. S. Hochbaum","year":"1990","unstructured":"Hochbaum, D. S., and J. G. Shanthikumar, 1990. Convex Separable Optimization is Not Much Harder than Linear Optimization,Journal of the ACM 37(4), 843\u2013862.","journal-title":"Journal of the ACM"},{"key":"BF02522821_CR10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01581207","volume":"55","author":"D. S. Hochbaum","year":"1992","unstructured":"Hochbaum, D. S., R. Shamir, and J. G. Shanthikumar 1992. A Polynomial Algorithm for an Integer Quadratic Non-Separable Transportation Problem,Mathematical Programming 55, 359\u2013371.","journal-title":"Mathematical Programming"},{"key":"BF02522821_CR11","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1287\/opre.21.3.846","volume":"21","author":"W. A. Horn","year":"1973","unstructured":"Horn, W. A. 1973. Minimizing Average Flow Time with Parallel Machines,Operations Research 21, 846\u2013847.","journal-title":"Operations Research"},{"key":"BF02522821_CR12","volume-title":"Resource Allocation Problems: Algorithmic Approaches","author":"T. Ibaraki","year":"1988","unstructured":"Ibaraki, T., and N. Katoh. 1988,Resource Allocation Problems: Algorithmic Approaches, MIT Press, Cambridge, MA."},{"key":"BF02522821_CR13","first-page":"445","volume-title":"Handbooks in Operations Research and Management Science","author":"E. L. Lawler","year":"1993","unstructured":"Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. 1993. Sequencing and Scheduling: Algorithms and Complexity, inHandbooks in Operations Research and Management Science, Volume 4, eds. S. C. Graves, A. H. G. Rinnooy Kan, and P. Zipkin, North-Holland Amsterdam, pp. 445\u2013522."},{"key":"BF02522821_CR14","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BFb0121104","volume":"26","author":"M. Minoux","year":"1986","unstructured":"Minoux, M. 1986. Solving Integer Minimum Cost Flows with Separable Convex Objective Polynomially,Mathematical Programming Study 26, 237\u2013239.","journal-title":"Mathematical Programming Study"},{"key":"BF02522821_CR15","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF01585748","volume":"46","author":"P. M. Pardalos","year":"1990","unstructured":"Pardalos, P. M., and N. Kovoor. 1990. An Algorithm for a Singly Constrained Class of Quadratic Programs Subject to Lower and Upper Bounds,Mathematical Programming 46, 321\u2013328.","journal-title":"Mathematical Programming"},{"key":"BF02522821_CR16","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,Mathematical Programming 59, 117\u2013132.","journal-title":"Mathematical Programming"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02522821.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02522821\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02522821","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:39:38Z","timestamp":1558283978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02522821"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["BF02522821"],"URL":"https:\/\/doi.org\/10.1007\/bf02522821","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}