{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T07:07:24Z","timestamp":1676790444318},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2009,7,29]],"date-time":"2009-07-29T00:00:00Z","timestamp":1248825600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s10951-009-0122-z","type":"journal-article","created":{"date-parts":[[2009,7,28]],"date-time":"2009-07-28T20:11:22Z","timestamp":1248811882000},"page":"529-541","source":"Crossref","is-referenced-by-count":8,"title":["Exact and approximate algorithms for high-multiplicity parallel machine scheduling"],"prefix":"10.1007","volume":"12","author":[{"given":"Carlo","family":"Filippi","sequence":"first","affiliation":[]},{"given":"Giorgio","family":"Romanin-Jacur","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,7,29]]},"reference":[{"issue":"1","key":"122_CR1","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0377-2217(93)90009-C","volume":"64","author":"G. Andreatta","year":"1993","unstructured":"Andreatta, G., Filippi, C., & Romanin-Jacur, G. (1993). The linear balancing flow problem. European Journal of Operational Research, 64(1), 68\u201382.","journal-title":"European Journal of Operational Research"},{"key":"122_CR2","unstructured":"Armstrong, R., Jin, Z., & Xu, Y. (1997). A polynomial algorithm for a linear balancing flow problem (Rutcor Research Report 24-97). Rutgers University."},{"key":"122_CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s101070100272","volume":"92","author":"D. Bertsimas","year":"2002","unstructured":"Bertsimas, D., & Sethuraman, J. (2002). From fluid relaxation to practical algorithms for job shop scheduling: the makespan objective. Mathematical Programming, 92, 61\u2013102.","journal-title":"Mathematical Programming"},{"key":"122_CR4","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s10878-005-1414-7","volume":"9","author":"N. Brauner","year":"2005","unstructured":"Brauner, N., Crama, Y., Grigoriev, A., & van De Klundert, J. (2005). A framework for the complexity of high-multiplicity scheduling problems. Journal of Combinatorial Optimization, 9, 313\u2013323.","journal-title":"Journal of Combinatorial Optimization"},{"key":"122_CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1111\/j.1467-9574.2007.00362.x","volume":"61","author":"N. Brauner","year":"2007","unstructured":"Brauner, N., Crama, Y., Grigoriev, A., & van De Klundert, J. (2007). Multiplicity and complexity issues in contemporary production scheduling. Statistica Neerlandica, 61, 75\u201391.","journal-title":"Statistica Neerlandica"},{"key":"122_CR6","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/PL00011403","volume":"89","author":"J. J. Clifford","year":"2001","unstructured":"Clifford, J. J., & Posner, M. E. (2001). Parallel machine scheduling with high multiplicity. Mathematical Programming, 89, 359\u2013383.","journal-title":"Mathematical Programming"},{"key":"122_CR7","volume-title":"Theory of scheduling","author":"W. L. Conway","year":"1967","unstructured":"Conway, W. L., Maxwell, W. L., & Miller, L. W. (1967). Theory of scheduling. Reading: Addison-Wesley."},{"key":"122_CR8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1023\/B:JOCO.0000031420.05971.29","volume":"8","author":"A. Frangioni","year":"2004","unstructured":"Frangioni, A., Necciari, E., & Scutell\u00e0, M. G. (2004). A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems. Journal of Combinatorial Optimization, 8, 195\u2013220.","journal-title":"Journal of Combinatorial Optimization"},{"key":"122_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"122_CR10","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., & Skorin-Kapov, J. (1993). On polynomial solvability of the high multiplicity total weighted tardiness problem. Discrete Applied Mathematics, 41, 139\u2013146.","journal-title":"Discrete Applied Mathematics"},{"key":"122_CR11","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1287\/opre.41.5.924","volume":"41","author":"T. Hamada","year":"1993","unstructured":"Hamada, T., & Glazebrook, K. D. (1993). A Bayesian sequential single machine scheduling problem to minimize the expected weighted sum of flowtimes of jobs with exponential processing times. Operations Research, 41, 924\u2013934.","journal-title":"Operations Research"},{"key":"122_CR12","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1145\/96559.96597","volume":"37","author":"D. S. Hochbaum","year":"1990","unstructured":"Hochbaum, D. S., & Shanthikumar, J. G. (1990). Convex separable optimization is not much harder than linear optimization. Journal of the Association for Computing Machinery, 37, 843\u2013862.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"122_CR13","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., & Shamir, R. (1991). Strongly polynomial algorithms for the high multiplicity scheduling problem. Operations Research, 39, 648\u2013653.","journal-title":"Operations Research"},{"key":"122_CR14","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01581207","volume":"55","author":"D. S. Hochbaum","year":"1992","unstructured":"Hochbaum, D. S., Shamir, R., & Shanthikumar, J. G. (1992). A\u00a0polynomial algorithm for an integer quadratic nonseparable transportation problem. Mathematical Programming, 55, 359\u2013376.","journal-title":"Mathematical Programming"},{"key":"122_CR15","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":"122_CR16","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E. Horowitz","year":"1976","unstructured":"Horowitz, E., & Sahni, S. (1976). Exact and approximate algorithms for scheduling nonidentical processors. Journal of the Association for Computing Machinery, 23, 317\u2013327.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"122_CR17","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1287\/opre.30.1.163","volume":"30","author":"J. Y.-T. Leung","year":"1982","unstructured":"Leung, J. Y.-T. (1982). On scheduling independent tasks with restricted execution times. Operations Research, 30, 163\u2013171.","journal-title":"Operations Research"},{"key":"122_CR18","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1287\/moor.26.1.31.10590","volume":"26","author":"S. T. McCormick","year":"2001","unstructured":"McCormick, S. T., Smallwood, S. R., & Spieksma, F. C. R. (2001). A\u00a0polynomial algorithm for multiprocessor scheduling with two job lengths. Mathematics of Operations Research, 26, 31\u201349.","journal-title":"Mathematics of Operations Research"},{"key":"122_CR19","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/opre.28.6.1347","volume":"28","author":"H. N. Psaraftis","year":"1980","unstructured":"Psaraftis, H. N. (1980). A dynamic programming approach for sequencing groups of identical jobs. Operations Research, 28, 347\u2013359.","journal-title":"Operations Research"},{"issue":"4","key":"122_CR20","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1287\/opre.44.4.617","volume":"44","author":"P. Serafini","year":"1996","unstructured":"Serafini, P. (1996). Scheduling jobs on several machines with the job splitting property. Operations Research, 44(4), 617\u2013628.","journal-title":"Operations Research"},{"issue":"2","key":"122_CR21","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1109\/LSP.2003.821658","volume":"11","author":"P. Tichavky","year":"2004","unstructured":"Tichavky, P., & Koldovsky, Z. (2004). Optimal pairing of signal components separated by blind techniques. IEEE Signal Processing Letters, 11(2), 119\u2013122.","journal-title":"IEEE Signal Processing Letters"},{"issue":"1\u20133","key":"122_CR22","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0166-218X(00)00176-1","volume":"103","author":"W. Xing","year":"2000","unstructured":"Xing, W., & Zhang, J. (2000). Parallel machine scheduling with splitting jobs. Discrete Applied Mathematics, 103(1\u20133), 259\u2013269.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0122-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0122-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0122-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:42Z","timestamp":1559468382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0122-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,29]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["122"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0122-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,29]]}}}