{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T11:57:57Z","timestamp":1775044677118,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10951-010-0191-z","type":"journal-article","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T20:59:22Z","timestamp":1281473962000},"page":"801-810","source":"Crossref","is-referenced-by-count":13,"title":["Using column generation to solve parallel machine scheduling problems with minmax objective functions"],"prefix":"10.1007","volume":"15","author":[{"given":"J. M.","family":"van\u00a0den Akker","sequence":"first","affiliation":[]},{"given":"J. A.","family":"Hoogeveen","sequence":"additional","affiliation":[]},{"given":"J. W.","family":"van Kempen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,11]]},"reference":[{"key":"191_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-based scheduling: applying constraint programming to scheduling problems","author":"P. Baptiste","year":"2001","unstructured":"Baptiste, P., Le Pape, C., & Nuijten, W. (2001). Constraint-based scheduling: applying constraint programming to scheduling problems. Dordrecht: Kluwer Academic."},{"key":"191_CR2","volume-title":"Linear programming and network flows","author":"M. S. Bazaraa","year":"1990","unstructured":"Bazaraa, M. S., Jarvis, J. J., & Sherali, H. D. (1990). Linear programming and network flows. New York: Wiley."},{"key":"191_CR3","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0377-2217(99)00489-0","volume":"127","author":"P. Brucker","year":"2000","unstructured":"Brucker, P., & Knust, S. (2000). A linear programming and constraint propagation-based lower bound for the RCPSP. European Journal of Operational Research, 127, 355\u2013362.","journal-title":"European Journal of Operational Research"},{"key":"191_CR4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1023\/A:1021149204501","volume":"115","author":"P. Brucker","year":"2002","unstructured":"Brucker, P., & Knust, S. (2002). Lower bounds for scheduling a single robot in a job-shop environment. Annals of Operations Research, 115, 147\u2013172.","journal-title":"Annals of Operations Research"},{"key":"191_CR5","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0377-2217(02)00762-2","volume":"149","author":"P. Brucker","year":"2003","unstructured":"Brucker, P., & Knust, S. (2003). Lower bounds for resource-constrained project scheduling problems. European Journal of Operational Research, 149, 302\u2013313.","journal-title":"European Journal of Operational Research"},{"key":"191_CR6","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0377-2217(87)90243-8","volume":"29","author":"J. Carlier","year":"1987","unstructured":"Carlier, J. (1987). Scheduling jobs with release dates and tails on identical machines to minimize the makespan. European Journal of Operational Research, 29, 298\u2013306.","journal-title":"European Journal of Operational Research"},{"key":"191_CR7","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1287\/ijoc.11.1.78","volume":"11","author":"Z. L. Chen","year":"1999","unstructured":"Chen, Z. L., & Powell, W. B. (1999). Solving parallel machine scheduling problems by column generation. INFORMS Journal on Computing, 11, 78\u201394.","journal-title":"INFORMS Journal on Computing"},{"key":"191_CR8","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01586059","volume":"54","author":"J. P. Sousa de","year":"1992","unstructured":"de Sousa, J. P., & Wolsey, L. A. (1992). A time-indexed formulation of non-preemptive single-machine scheduling problems. Mathematical Programming, 54, 353\u2013367.","journal-title":"Mathematical Programming"},{"key":"191_CR9","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","volume":"13","author":"M. R. Garey","year":"1988","unstructured":"Garey, M. R., Tarjan, R. E., & Wilfong, G. T. (1988). One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research, 13, 330\u2013348.","journal-title":"Mathematics of Operations Research"},{"key":"191_CR10","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":"191_CR11","unstructured":"Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness (Research Report 43). Management Sciences Research Project, UCLA."},{"key":"191_CR12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"E. L. Lawler","year":"1969","unstructured":"Lawler, E. L., & Moore, J. M. (1969). A functional equation and its application to resource allocation and sequencing problems. Management Science, 16, 77\u201384.","journal-title":"Management Science"},{"key":"191_CR13","unstructured":"van\u00a0den Akker, J. M. (1994). LP-based solution methods for single-machine scheduling problems. PhD thesis, Eindhoven University of Technology."},{"key":"191_CR14","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1287\/opre.47.6.862","volume":"47","author":"J. M. Akker van\u00a0den","year":"1999","unstructured":"van\u00a0den Akker, J. M., Hoogeveen, J. A., & Van\u00a0de Velde, S. L. (1999). Parallel machine scheduling by column generation. Operations Research, 47, 862\u2013872.","journal-title":"Operations Research"},{"key":"191_CR15","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/0-387-25486-2_11","volume-title":"Column generation","author":"J. M. Akker van\u00a0den","year":"2005","unstructured":"van\u00a0den Akker, J. M., Hoogeveen, J. A., & Van\u00a0de Velde, S. L. (2005). Applying column generation to machine scheduling. In G. Desaulniers, J. Desrosiers, & M. M. Solomon (Eds.), Column generation (pp. 303\u2013330). Berlin: Springer."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0191-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T10:23:54Z","timestamp":1551608634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0191-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,11]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["191"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0191-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,11]]}}}