{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T16:31:17Z","timestamp":1747758677610,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T00:00:00Z","timestamp":1554681600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s10479-019-03212-3","type":"journal-article","created":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T06:02:41Z","timestamp":1554703361000},"page":"247-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A cutting plane approach for the multi-machine precedence-constrained scheduling problem"],"prefix":"10.1007","volume":"285","author":[{"given":"Prahalad","family":"Venkateshan","sequence":"first","affiliation":[]},{"given":"Joseph","family":"Szmerekovsky","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7871-7990","authenticated-orcid":false,"given":"George","family":"Vairaktarakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,8]]},"reference":[{"key":"3212_CR1","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.cie.2016.05.020","volume":"98","author":"M Afzairad","year":"2016","unstructured":"Afzairad, M., & Rezaeian, J. (2016). Resource-constrained unrelated parallel machine scheduling problem with sequence dependent setup times, precedence constraints and machine eligibility restrictions. Computers and Industrial Engineering, 98, 40\u201352.","journal-title":"Computers and Industrial Engineering"},{"key":"3212_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.cor.2018.06.013","volume":"99","author":"YK Agarwal","year":"2018","unstructured":"Agarwal, Y. K. (2018). Network loading problem: Valid inequalities from 5-and higher partitions. Computers and Operations Research, 99, 123\u2013134.","journal-title":"Computers and Operations Research"},{"key":"3212_CR3","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cie.2016.12.038","volume":"105","author":"JEC Arroyo","year":"2017","unstructured":"Arroyo, J. E. C., & Leung, J. Y.-T. (2017a). An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times. Computers and Industrial Engineering, 105, 84\u2013100.","journal-title":"Computers and Industrial Engineering"},{"key":"3212_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.cor.2016.08.015","volume":"78","author":"JEC Arroyo","year":"2017","unstructured":"Arroyo, J. E. C., & Leung, J. Y.-T. (2017b). Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times. Computers and Operations Research, 78, 117\u2013128.","journal-title":"Computers and Operations Research"},{"key":"3212_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BFb0121051","volume":"24","author":"E Balas","year":"1985","unstructured":"Balas, E. (1985). On the facial structure of scheduling polyhedra. Mathematical Programming Study, 24, 179\u2013218.","journal-title":"Mathematical Programming Study"},{"key":"3212_CR6","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/j.jclepro.2017.04.018","volume":"156","author":"A Che","year":"2017","unstructured":"Che, A., Zhang, S., & Wu, X. (2017). Energy-conscious unrelated parallel machine scheduling under time-of-use electricity tariffs. Journal of Cleaner Production, 156, 688\u2013697.","journal-title":"Journal of Cleaner Production"},{"issue":"1","key":"3212_CR7","doi-asserted-by":"publisher","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(1), 78\u201394.","journal-title":"INFORMS Journal on Computing"},{"key":"3212_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmsy.2016.10.005","volume":"42","author":"C-Y Cheng","year":"2017","unstructured":"Cheng, C.-Y., & Huang, L. W. (2017). Minimizing total earliness and tardiness through unrelated parallel machine scheduling using distributed release time control. Journal of Manufacturing Systems, 42, 1\u201310.","journal-title":"Journal of Manufacturing Systems"},{"key":"3212_CR9","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1016\/j.dam.2004.07.009","volume":"154","author":"PE Coll","year":"2006","unstructured":"Coll, P. E., Ribeiro, C. C., & de Souza, C. C. (2006). Multiprocessor scheduling under precedence constraints: Polyhedral results. Discrete Applied Mathematics, 154, 770\u2013801.","journal-title":"Discrete Applied Mathematics"},{"key":"3212_CR10","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/s00291-010-0233-0","volume":"34","author":"I Correia","year":"2012","unstructured":"Correia, I., Louren\u00e7o, L. L., & Saldanha-da-Gama, F. (2012). Project scheduling with flexible resources: Formulation and inequalities. OR Spectrum, 34, 635\u2013663.","journal-title":"OR Spectrum"},{"key":"3212_CR11","doi-asserted-by":"publisher","first-page":"1610","DOI":"10.1016\/j.cor.2009.12.001","volume":"37","author":"IR Farias Jr de","year":"2010","unstructured":"de Farias Jr, I. R., Zhoa, H., & Zhao, M. (2010). A family of inequalities valid for the robust single machine scheduling polyhedron. Computers and Operations Research, 37, 1610\u20131614.","journal-title":"Computers and Operations Research"},{"key":"3212_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0166-218X(90)90104-K","volume":"26","author":"ME Dyer","year":"1990","unstructured":"Dyer, M. E., & Wolsey, L. A. (1990). Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics, 26, 255\u2013270.","journal-title":"Discrete Applied Mathematics"},{"key":"3212_CR13","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/j.ejor.2017.01.002","volume":"260","author":"L Fanjul-Peyro","year":"2017","unstructured":"Fanjul-Peyro, L., Perea, F., & Ruiz, R. (2017). Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources. European Journal of Operatonal Research, 260, 482\u2013493.","journal-title":"European Journal of Operatonal Research"},{"key":"3212_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnoy 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":"3212_CR15","unstructured":"Hassan, M. A., Kacem, I., Martin, S., & Osman, I. M. (2016). Unrelated parallel machine scheduling problem with precedence constraints: Polyhedral analysis and branch-and-cut. In Combinatorial optimization: 4th international symposium (Vol. ISCO, pp. 308\u2013319)."},{"key":"3212_CR16","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/S0377-2217(96)00247-0","volume":"102","author":"J Herrmann","year":"1997","unstructured":"Herrmann, J., Proth, J.-M., & Sauer, N. (1997). Heuristics for unrelated machine scheduling with precedence constraints. European Journal of Operational Research, 102, 528\u2013537.","journal-title":"European Journal of Operational Research"},{"key":"3212_CR17","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.asoc.2016.12.038","volume":"53","author":"CM Joo","year":"2017","unstructured":"Joo, C. M., & Kim, B. S. (2017). Rule-based meta-heuristics for integrated scheduling of unrelated parallel machines, batches, and heterogeneous delivery trucks. Applied Soft Computing, 53, 457\u2013476.","journal-title":"Applied Soft Computing"},{"issue":"1","key":"3212_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., & Sprecher, A. (1997). PSPLIB-a project scheduling problem library: OR software-ORSEP operations research software exchange program. European Journal of Operational Research, 96(1), 205\u2013216.","journal-title":"European Journal of Operational Research"},{"key":"3212_CR19","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s00453-007-9004-y","volume":"55","author":"VSA Kumar","year":"2009","unstructured":"Kumar, V. S. A., Marathe, M. V., Parthasarathy, S., & Srinivasan, A. (2009). Scheduling on unrelated machines under tree-like precedence constraints. Algorithmica, 55, 205\u2013226.","journal-title":"Algorithmica"},{"key":"3212_CR20","doi-asserted-by":"crossref","unstructured":"Liu, C. (2013). A hybrid genetic algorithm to minimize total tardiness for unrelated parallel machine scheduling with precedence constraints. Mathematical Problems in Engineering. Article ID 537127","DOI":"10.1155\/2013\/537127"},{"issue":"6","key":"3212_CR21","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.4304\/jsw.6.6.1146-1153","volume":"6","author":"C Liu","year":"2011","unstructured":"Liu, C., & Yang, S. (2011). A heuristic serial schedule algorithm for unrelated parallel machine scheduling with precedence constraints. Journal of Software, 6(6), 1146\u20131153.","journal-title":"Journal of Software"},{"issue":"2","key":"3212_CR22","first-page":"193","volume":"18","author":"E Mokotoff","year":"2001","unstructured":"Mokotoff, E. (2001). Parallel machine scheduling problems: A survey. Asia-Pacific Journal of Operational Research, 18(2), 193\u2013242.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"2004","key":"3212_CR23","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1016\/S0377-2217(02)00726-9","volume":"152.3","author":"E Mokotoff","year":"2004","unstructured":"Mokotoff, E. (2004). An exact algorithm for the identical parallel machine scheduling problem. European Journal of Operational Research, 152.3(2004), 758\u2013769.","journal-title":"European Journal of Operational Research"},{"key":"3212_CR24","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/S0377-2217(01)00270-3","volume":"141","author":"E Mokotoff","year":"2002","unstructured":"Mokotoff, E., & Chr\u00e9tienne, P. (2002). A cutting plane algorithm for the unrelated parallel machine scheduling problem. European Journal of Operational Research, 141, 515\u2013525.","journal-title":"European Journal of Operational Research"},{"issue":"16","key":"3212_CR25","doi-asserted-by":"publisher","first-page":"4778","DOI":"10.1080\/00207543.2013.774469","volume":"51","author":"T Nishi","year":"2013","unstructured":"Nishi, T., & Hiranaka, Y. (2013). Lagrangian relaxation and cut generation for sequence-dependent setup time flowshop scheduling problems to minimise the total weighted tardiness. International Journal of Production Research, 51(16), 4778\u20134796.","journal-title":"International Journal of Production Research"},{"key":"3212_CR26","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.cor.2009.04.008","volume":"37","author":"T Nishi","year":"2010","unstructured":"Nishi, T., Hiranaka, Y., & Inuiguchi, M. (2010). Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness. Computers and Operations Research, 37, 189\u2013198.","journal-title":"Computers and Operations Research"},{"key":"3212_CR27","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/0377-2217(93)90062-R","volume":"67","author":"RS-V Olagu\u00edel","year":"1993","unstructured":"Olagu\u00edel, R. S.-V., & Goerlich, J. M. T. (1993). The project scheduling polyhedron: Dimension, facets, and lifting theorems. European Journal of Operational Research, 67, 204\u2013220.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"3212_CR28","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1287\/mnsc.31.10.1300","volume":"31","author":"CN Potts","year":"1985","unstructured":"Potts, C. N. (1985). A Lagrangean based branch and bound algorithm for single machine sequencing with precedence constraints to minimize total weighted completion time. Management Science, 31(10), 1300\u20131311.","journal-title":"Management Science"},{"key":"3212_CR29","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01581271","volume":"58","author":"M Queyranne","year":"1993","unstructured":"Queyranne, M. (1993). Structure of a simple scheduling polyhedron. Mathematical Programming, 58, 263\u2013285.","journal-title":"Mathematical Programming"},{"issue":"1","key":"3212_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.16.1.1","volume":"16","author":"M Queyranne","year":"1991","unstructured":"Queyranne, M., & Wang, Y. (1991). Single-machine scheduling polyhedra with precedence constraints. Mathematics of Operations Research, 16(1), 1\u201320.","journal-title":"Mathematics of Operations Research"},{"key":"3212_CR31","unstructured":"Schulz, A. S. (1995). Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds. In International conference on integer programming and combinatorial optimization. Springer, Berlin."},{"key":"3212_CR32","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.cor.2016.07.021","volume":"77","author":"O Shahvari","year":"2017","unstructured":"Shahvari, O., & Logendran, R. (2017). An Enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes. Computers and Operations Research, 77, 154\u2013176.","journal-title":"Computers and Operations Research"},{"key":"3212_CR33","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10107-016-1004-8","volume":"161","author":"R Sitters","year":"2017","unstructured":"Sitters, R. (2017). Approximability of average completion time scheduling on unrelated machines. Mathematical Programming Series A, 161, 135\u2013158.","journal-title":"Mathematical Programming Series A"},{"key":"3212_CR34","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizer for single-stage production. Naval Research Logistics Quarterly, 3, 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"key":"3212_CR35","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/S0377-2217(99)00493-2","volume":"127","author":"K \u0160ori\u0107","year":"2000","unstructured":"\u0160ori\u0107, K. (2000). A cutting plane algorithm for a single machine scheduling problem. European Journal of Operational Research, 127, 383\u2013393.","journal-title":"European Journal of Operational Research"},{"key":"3212_CR36","volume-title":"Maximizing project net-present value and minimizing work-in-progress costs in projects","author":"JG Szmerekovsky","year":"2003","unstructured":"Szmerekovsky, J. G. (2003). Maximizing project net-present value and minimizing work-in-progress costs in projects. Cleveland, OH: Case Western Reserve University."},{"key":"3212_CR37","doi-asserted-by":"publisher","first-page":"3224","DOI":"10.1016\/j.cor.2009.02.012","volume":"36","author":"R Tavakkoli-Moghaddan","year":"2009","unstructured":"Tavakkoli-Moghaddan, R., Taheri, F., Bazzazi, M., Izadi, M., & Sassani, F. (2009). Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. Computers and Operations Research, 36, 3224\u20133230.","journal-title":"Computers and Operations Research"},{"key":"3212_CR38","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.cie.2017.05.007","volume":"109","author":"Y-B Woo","year":"2017","unstructured":"Woo, Y.-B., Jung, S., & Kim, B. S. (2017). A rule-based genetic algorithm with an improvement heuristic for unrelated parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities. Computers and Industrial Engineering, 109, 179\u2013190.","journal-title":"Computers and Industrial Engineering"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03212-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-019-03212-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03212-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T23:34:13Z","timestamp":1586216053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-019-03212-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,8]]},"references-count":38,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["3212"],"URL":"https:\/\/doi.org\/10.1007\/s10479-019-03212-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2019,4,8]]},"assertion":[{"value":"8 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}