{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:35:32Z","timestamp":1756384532556},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,9,27]],"date-time":"2014-09-27T00:00:00Z","timestamp":1411776000000},"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":["Optim Lett"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s11590-014-0802-2","type":"journal-article","created":{"date-parts":[[2014,9,26]],"date-time":"2014-09-26T08:58:09Z","timestamp":1411721889000},"page":"1091-1107","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["New MIP model for multiprocessor scheduling problem with communication delays"],"prefix":"10.1007","volume":"11","author":[{"given":"Abdessamad","family":"Ait El Cadi","sequence":"first","affiliation":[]},{"given":"Rabie","family":"Ben Atitallah","sequence":"additional","affiliation":[]},{"given":"Sa\u00efd","family":"Hanafi","sequence":"additional","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]},{"given":"Abdelhakim","family":"Artiba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,27]]},"reference":[{"key":"802_CR1","unstructured":"Ali, H., El-Rewini, H.: An optimal algorithm for scheduling interval ordered tasks with communication on N processor, University of Nebraska at Omaha, Math. and Computer Science Department, Technical Report, 9120 (1990)"},{"key":"802_CR2","doi-asserted-by":"crossref","first-page":"217225","DOI":"10.1080\/09537280601035836","volume":"18","author":"E Cakici","year":"2007","unstructured":"Cakici, E., Mason, S.J.: Parallel machine scheduling subject to auxiliary resource constraints. Prod. Plan. Control. 18, 217225 (2007)","journal-title":"Prod. Plan. Control."},{"issue":"3","key":"802_CR3","first-page":"287303","volume":"27","author":"WH Chen","year":"2000","unstructured":"Chen, W.H., Lin, C.S.: A hybrid heuristic to solve a task allocation problem. Comput. Oper. Res. 27(3), 287303 (2000)","journal-title":"Comput. Oper. Res."},{"key":"802_CR4","first-page":"6590","volume-title":"Scheduling theory and its applications","author":"P Chr\u00e9tienne","year":"1995","unstructured":"Chr\u00e9tienne, P., Picouleau, C.: Scheduling with communication delays: a survey. In: Chr\u00e9tienne, P., Coffman, E.G., Lenstra, J.K., Liu, Z. (eds.) Scheduling theory and its applications, p. 6590. Wiley, New York (1995)"},{"key":"802_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1362-8","volume-title":"Scheduling and automatic parallelization","author":"A Darte","year":"2000","unstructured":"Darte, A., Robert, Y., Vivien, F.: Scheduling and automatic parallelization. Birkhuser, Boston (2000)"},{"issue":"3","key":"802_CR6","doi-asserted-by":"crossref","first-page":"273288","DOI":"10.1002\/nav.10056","volume":"50","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"2003","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., Sevaux, M.: Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine. Nav. Res Logist. 50(3), 273288 (2003)","journal-title":"Nav. Res Logist."},{"key":"802_CR7","doi-asserted-by":"crossref","first-page":"21552177","DOI":"10.1016\/j.cor.2005.01.005","volume":"33","author":"T Davidovi\u0107","year":"2006","unstructured":"Davidovi\u0107, T., Crainic, T.G.: Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems. Comput. Oper. Res. 33, 21552177 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"802_CR8","doi-asserted-by":"crossref","first-page":"297326","DOI":"10.1142\/S021759590500056X","volume":"22","author":"T Davidovi\u0107","year":"2005","unstructured":"Davidovi\u0107, T., Hansen, P., Mladenovi\u0107, N.: Permutation-based genetic, tabu and variable neigh-borhood search heuristics for multiprocessor scheduling with communication delays. Asia Pacific J. Oper. Res. 22(3), 297326 (2005)","journal-title":"Asia Pacific J. Oper. Res."},{"key":"802_CR9","unstructured":"Davidovi\u0107, T., Liberti, L., Maculan, N., Mladenovi\u0107, N.: Towards the optimal solution of the multiprocessor scheduling problem with communication delays. MISTA Proceedings (2007)"},{"issue":"9","key":"802_CR10","doi-asserted-by":"crossref","first-page":"11971214","DOI":"10.1016\/S0167-8191(96)00041-5","volume":"22","author":"GL Djordjevi\u0107","year":"1996","unstructured":"Djordjevi\u0107, G.L., To\u0161i\u0107, M.B.: A heuristic for scheduling task graphs with communication delays onto multiprocessors. Parallel Comput. 22(9), 11971214 (1996)","journal-title":"Parallel Comput."},{"key":"802_CR11","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. WH Freeman & Co., San Francisco (1979)"},{"key":"802_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4803-1","volume-title":"Combinatorics and graph theory","author":"JM Harris","year":"2000","unstructured":"Harris, J.M.: Combinatorics and graph theory. Springer, New York (2000)"},{"key":"802_CR13","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.ejor.2009.11.005","volume":"207","author":"S Hartmann","year":"2010","unstructured":"Hartmann, S., Briskorn, D.: A survey of variants and extensions of the resource-constrained project scheduling problem. Eur. J. Oper. Res. 207, 114 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"802_CR14","doi-asserted-by":"crossref","first-page":"976993","DOI":"10.1016\/j.cor.2006.05.013","volume":"35","author":"R Hwang","year":"2008","unstructured":"Hwang, R., Gen, M., Katayama, H.: A comparison of multiprocessor task scheduling algorithms with communication costs. Comput. Oper. Res. 35, 976993 (2008)","journal-title":"Comput. Oper. Res."},{"key":"802_CR15","doi-asserted-by":"crossref","first-page":"309316","DOI":"10.1007\/BF01108764","volume":"11","author":"G Isaak","year":"1994","unstructured":"Isaak, G.: Scheduling rooted forests with communication delays. Order 11, 309316 (1994)","journal-title":"Order"},{"key":"802_CR16","volume-title":"The art of computer programming","author":"DE Knuth","year":"1991","unstructured":"Knuth, D.E.: The art of computer programming, vol. 1, 3rd edn. Addison-Wesley, Boston (1991)","edition":"3"},{"key":"802_CR17","first-page":"695714","volume":"67","author":"P Luo","year":"2007","unstructured":"Luo, P., L, K., Shi, Z.: A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems. J. Parallel Distrib. Comput. 67, 695714 (2007)","journal-title":"J. Parallel Distrib. Comput."},{"key":"802_CR18","doi-asserted-by":"crossref","first-page":"10971100","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 10971100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"802_CR19","volume-title":"Operations research: deterministic optimization models","author":"KG Murty","year":"1994","unstructured":"Murty, K.G.: Operations research: deterministic optimization models. Prentice-Hall, Englewood Cliffs (1994)"},{"key":"802_CR20","volume-title":"Scheduling: theory, algorithms, and systems","author":"M Pinedo","year":"2002","unstructured":"Pinedo, M.: Scheduling: theory, algorithms, and systems, 2nd edn. Prentice-Hall, New Jersey (2002)","edition":"2"},{"key":"802_CR21","unstructured":"Prastein, M.: Precedence-constrained scheduling with minimum time and communication. MS Thesis, University of Illinois at Urbana-Champaign (1987)"},{"key":"802_CR22","first-page":"5571","volume":"18","author":"VJ Rayward-Smith","year":"1987","unstructured":"Rayward-Smith, V.J.: UET scheduling with unit interprocessor communication delays. Discret. Appl. Math. 18, 5571 (1987)","journal-title":"Discret. Appl. Math."},{"key":"802_CR23","doi-asserted-by":"crossref","first-page":"353367","DOI":"10.1007\/BF01586059","volume":"54","author":"JP Sousa","year":"1992","unstructured":"Sousa, J.P., Wolsey, L.A.: A time-indexed formulation of nonpreemptive single machine scheduling problems. Math. Progr. 54, 353367 (1992)","journal-title":"Math. Progr."},{"key":"802_CR24","doi-asserted-by":"crossref","unstructured":"Unlu, Y., Mason, S.J.: Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems. Comput. Ind. Eng., Pergamon Press Inc., 58, 785800 (2010)","DOI":"10.1016\/j.cie.2010.02.012"},{"issue":"5","key":"802_CR25","doi-asserted-by":"crossref","first-page":"738741","DOI":"10.1287\/mnsc.44.5.738","volume":"44","author":"TL Urban","year":"1998","unstructured":"Urban, T.L.: Note. Optimal balancing of U-shaped assembly lines. Manag. Sci. 44(5), 738741 (1998)","journal-title":"Manag. Sci."},{"key":"802_CR26","doi-asserted-by":"crossref","unstructured":"Venugopalan, S., Sinnen, O.: Optimal linear programming solutions for multiprocessor scheduling with communication delays. In: Xiang, Y., Stojmenovic, I., Apduhan, B.O., Wang, G., Nakano, K., Zomaya, A. (eds.) Algorithms and architectures for parallel processing, pp. 129138. Springer, Heidelberg, 7439, (2012)","DOI":"10.1007\/978-3-642-33078-0_10"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0802-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0802-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0802-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0802-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T12:19:16Z","timestamp":1565871556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0802-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,27]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["802"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0802-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,27]]}}}