{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:19:44Z","timestamp":1743131984638,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662493892"},{"type":"electronic","value":"9783662493908"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49390-8_28","type":"book-chapter","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T18:17:15Z","timestamp":1457374635000},"page":"286-295","source":"Crossref","is-referenced-by-count":5,"title":["Solving a Malleable Jobs Scheduling Problem to Minimize Total Weighted Completion Times by Mixed Integer Linear Programming Models"],"prefix":"10.1007","author":[{"given":"Nhan-Quy","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farouk","family":"Yalaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lionel","family":"Amodeo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hicham","family":"Chehade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Toggenburger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Atakan, S., Lulli, G., Sen, S.: An improved mip formulation for the unit commitment problem (2015)"},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/1.9780898718805.ch18","volume-title":"The Sharpest Cut","author":"Robert E. Bixby","year":"2004","unstructured":"Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: Mixed integer programming: a progress report. The sharpest cut: The impact of Manfred Padberg and his work, MPS-SIAM Series on Optimization, vol. 4, pp. 309\u2013326 (2004)"},{"issue":"4","key":"28_CR3","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1109\/TC.2006.58","volume":"55","author":"J Blazewicz","year":"2006","unstructured":"Blazewicz, J., Kovalyov, M.Y., Machowiak, M., Trystram, D., Weglarz, J.: Preemptable malleable task scheduling problem. IEEE Trans. Comput. 55(4), 486\u2013490 (2006)","journal-title":"IEEE Trans. Comput."},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/978-3-662-04363-9_9","volume-title":"Scheduling Computer and Manufacturing Processes","author":"Jacek B\u0142a\u017cewicz","year":"2001","unstructured":"Blazewicz, P.D.J., Ecker, P.D.K.H., Pesch, P.D.E., Schmidt, P.D.G., Weglarz, P.D.J.: Scheduling under resource constraints. In: Scheduling Computer and Manufacturing Processes, pp. 317\u2013365. Springer, Heidelberg (2001)"},{"issue":"8","key":"28_CR5","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1287\/mnsc.33.8.1001","volume":"33","author":"M Dror","year":"1987","unstructured":"Dror, M., Stern, H.I., Lenstra, J.K.: Parallel machine scheduling: processing rates dependent on number of jobs in operation. Manage. Sci. 33(8), 1001\u20131009 (1987)","journal-title":"Manage. Sci."},{"key":"28_CR6","unstructured":"Dutot, P.-F., Mouni\u00e9, G., Trystram, D.: Scheduling parallel tasks: approximation algorithms. Handbook of Scheduling: Algorithms, Models, and Performance Analysis, pp. 1\u201326 (2004)"},{"issue":"5","key":"28_CR7","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.jpdc.2012.01.011","volume":"72","author":"L Fan","year":"2012","unstructured":"Fan, L., Zhang, F., Wang, G., Liu, Z.: An effective approximation algorithm for the malleable parallel task scheduling problem. J. Parallel Distrib. Comput. 72(5), 693\u2013704 (2012)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"28_CR8","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1287\/opre.1060.0371","volume":"55","author":"JN Hooker","year":"2007","unstructured":"Hooker, J.N.: Planning and scheduling by logic-based benders decomposition. Oper. Res. 55(3), 588\u2013602 (2007)","journal-title":"Oper. Res."},{"issue":"1","key":"28_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.jcss.2011.04.003","volume":"78","author":"K Jansen","year":"2012","unstructured":"Jansen, K., Zhang, H.: Scheduling malleable tasks with precedence constraints. J. Comput. Syst. Sci. 78(1), 245\u2013259 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Jedrzejowicz, P., Skakovski, A.: Population learning with differential evolution for the discrete-continuous scheduling with continuous resource discretisation. In: 2013 IEEE International Conference on Cybernetics (CYBCONF), pp. 92\u201397 (2013)","DOI":"10.1109\/CYBConf.2013.6617423"},{"key":"28_CR11","unstructured":"Lima, R.M., Grossmann, I.E.: Computational advances in solving mixed integer linear programming problems (2011)"},{"key":"28_CR12","series-title":"Mixed integer programming computation","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/978-3-540-68279-0_16","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"A Lodi","year":"2010","unstructured":"Lodi, A.: 50 Years of Integer Programming 1958\u20132008. Mixed integer programming computation, pp. 619\u2013645. Springer, Heidelberg (2010)"},{"key":"28_CR13","unstructured":"Nguyen, N.-Q., Yalaoui, F., Amodeo, L., Chehade, H., Toggenburger, P.: Total completion time minimization for machine scheduling problem under time windows constraints with jobs\u2019 linear processing rate function. Journal of Scheduling, manuscript submitted for publication (2015)"},{"issue":"1","key":"28_CR14","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ejor.2011.10.017","volume":"218","author":"R Rozycki","year":"2012","unstructured":"Rozycki, R., Weglarz, J.: Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines. Eur. J. Oper. Res. 218(1), 68\u201375 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"28_CR15","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1016\/j.cor.2011.02.023","volume":"39","author":"R Sadykov","year":"2012","unstructured":"Sadykov, R.: A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time. Comput. Oper. Res. 39(6), 1265\u20131270 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"28_CR16","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1109\/TPWRS.2007.901092","volume":"22","author":"J Sirikum","year":"2007","unstructured":"Sirikum, J., Techanitisawad, A., Kachitvichyanukul, V.: A new efficient ga-benders\u2019 decomposition method: for power generation expansion planning with emission controls. IEEE Trans. Power Syst. 22(3), 1092\u20131100 (2007)","journal-title":"IEEE Trans. Power Syst."},{"issue":"1","key":"28_CR17","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.ijpe.2004.12.007","volume":"99","author":"DN Tahar","year":"2006","unstructured":"Tahar, D.N., Yalaoui, F., Chu, C., Amodeo, L.: A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times. Int. J. Prod. Econ. 99(1), 63\u201373 (2006)","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"28_CR18","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.ijpe.2004.11.002","volume":"100","author":"F Yalaoui","year":"2006","unstructured":"Yalaoui, F., Chu, C.: New exact method to solve the $${P_{m}}\/r_{j}\/\\sum {C_{j}}$$ schedule problem. Int. J. Prod. Econ. 100(1), 168\u2013179 (2006)","journal-title":"Int. J. Prod. Econ."}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49390-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T12:55:01Z","timestamp":1720788901000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-49390-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662493892","9783662493908"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49390-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}