{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:32:15Z","timestamp":1757313135574},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,10,3]],"date-time":"2018-10-03T00:00:00Z","timestamp":1538524800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,10,3]],"date-time":"2018-10-03T00:00:00Z","timestamp":1538524800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s12351-018-0432-z","type":"journal-article","created":{"date-parts":[[2018,10,3]],"date-time":"2018-10-03T14:23:26Z","timestamp":1538576606000},"page":"55-71","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Heuristic algorithms for scheduling intrees on m machines with non-availability constraints"],"prefix":"10.1007","volume":"21","author":[{"given":"Khaoula","family":"Ben Abdellafou","sequence":"first","affiliation":[]},{"given":"Hatem","family":"Hadda","sequence":"additional","affiliation":[]},{"given":"Ouajdi","family":"Korbaa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,3]]},"reference":[{"key":"432_CR2","unstructured":"Ben-Abdellafou K, Korbaa O (2016) A novel algorithm for scheduling intrees on two parallel machines with unavailabilities. In: IEEE international conference on systems man and cybernetics, Budapest, Hungary"},{"issue":"3","key":"432_CR3","doi-asserted-by":"publisher","first-page":"1790","DOI":"10.1016\/j.ifacol.2015.06.346","volume":"48","author":"K Ben-Abdellafou","year":"2015","unstructured":"Ben-Abdellafou K, Sanlaville E, Mahjoub A, Ouajdi K (2015) Scheduling UECT trees with communication delays on two processors with unavailabilities INCOM ottawa canada. IFAC-PapersOnLine 48(3):1790\u20131795","journal-title":"IFAC-PapersOnLine"},{"key":"432_CR4","first-page":"384","volume":"557","author":"K Ben-Abdellafou","year":"2017","unstructured":"Ben-Abdellafou K, Hadda H, Korbaa O (2017) Heuristic for scheduling intrees on m machines with non-availability constraints. ISDA Intell Syst Des Appl 557:384\u2013393","journal-title":"ISDA Intell Syst Des Appl"},{"issue":"1","key":"432_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0166-218X(91)90013-M","volume":"30","author":"L Chung-Yee","year":"1991","unstructured":"Chung-Yee L (1991) Parallel machines scheduling with non-simultaneous machine available time. Discrete Appl Math 30(1):53\u201361","journal-title":"Discrete Appl Math"},{"issue":"3","key":"432_CR7","first-page":"395","volume":"9","author":"L Chung-Yee","year":"1996","unstructured":"Chung-Yee L (1996) Machine scheduling with an availability constraint. J Global Optim 9(3):395\u2013416","journal-title":"J Global Optim"},{"issue":"3","key":"432_CR9","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"Coffman Jr","year":"1972","unstructured":"Coffman Jr, Graham RL (1972) Optimal scheduling for two-processor systems. Acta Inform 1(3):200\u2013213","journal-title":"Acta Inform"},{"issue":"1","key":"432_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy KAHG (1979) Optimization and approximation in deterministic sequencing and scheduling. Ann Discrete Math 5(1):287\u2013326","journal-title":"Ann Discrete Math"},{"issue":"2","key":"432_CR11","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1051\/ro:2000101","volume":"34","author":"F Guinand","year":"2000","unstructured":"Guinand F, Trystram D (2000) Scheduling UET trees with communication delays on two processors. Rairo Oper Res 34(2):131\u2013144","journal-title":"Rairo Oper Res"},{"issue":"10","key":"432_CR12","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1109\/71.629491","volume":"8","author":"F Guinand","year":"1997","unstructured":"Guinand F, Rapine C, Trystram D (1997) Worst-case analysis of algorithms for scheduling UECT trees on m processors. IEEE Trans Parall Distrib 8(10):1085\u20131086","journal-title":"IEEE Trans Parall Distrib"},{"issue":"7","key":"432_CR17","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1007\/s00170-005-0102-1","volume":"30","author":"R Panneerselvam","year":"2006","unstructured":"Panneerselvam R (2006) Simple heuristic to minimize total tardiness in a single machine scheduling problem. Int J Adv Manuf Technol 30(7):722\u2013726","journal-title":"Int J Adv Manuf Technol"},{"issue":"10","key":"432_CR18","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/s001700070030","volume":"16","author":"SG Ponnambalam","year":"2000","unstructured":"Ponnambalam SG, Aravindan P, Rajesh SV (2000) A tabu search algorithm for job shop scheduling. Int J Adv Manuf Technol 16(10):765\u2013771","journal-title":"Int J Adv Manuf Technol"},{"issue":"10","key":"432_CR19","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1109\/71.629491","volume":"8","author":"C Rapine","year":"1997","unstructured":"Rapine C, Guinand F, Trystram D (1997) Worst case snalysis of Lawler\u2019s algorithm for scheduling trees with communication delays. IEEE T Parall Distrib 8(10):1085\u20131086","journal-title":"IEEE T Parall Distrib"},{"key":"432_CR20","unstructured":"Saad R (2007) Scheduling with communication delays. Technical report 754, LRI, University of Paris Sud, Paris, France"},{"issue":"3","key":"432_CR21","first-page":"395","volume":"9","author":"A Safi","year":"2014","unstructured":"Safi A, Trystram D, Canon L (2014) A proactive approach for coping with uncertain resource availabilities on desktop grids. High Perform Comput Goa India 9(3):395\u2013416","journal-title":"High Perform Comput Goa India"},{"key":"432_CR22","unstructured":"Sanlaville E, Mahjoub A, Guinand F (2014) Problmes d\u2019ordonnancement sur machines parallles avec tches communicantes et indisponibilits (In french). ROADEF, Marseille, France"},{"issue":"10","key":"432_CR23","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1109\/71.539738","volume":"7","author":"AV Theodora","year":"1996","unstructured":"Theodora AV, Vwani PR, Thomas K, Lawler E (1996) Scheduling in and out forests in the presence of communication delays. IEEE Trans Parall Distrib 7(10):1065\u20131074","journal-title":"IEEE Trans Parall Distrib"},{"issue":"2","key":"432_CR24","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0167-8191(90)90056-F","volume":"16","author":"B Veltman","year":"1990","unstructured":"Veltman B, Lageweg BJ, Lenstra JK (1990) Multiprocessor scheduling with communication delays. Parallel Comput 16(2):173\u2013182","journal-title":"Parallel Comput"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0432-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-018-0432-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0432-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T02:09:19Z","timestamp":1613700559000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-018-0432-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["432"],"URL":"https:\/\/doi.org\/10.1007\/s12351-018-0432-z","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,3]]},"assertion":[{"value":"18 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}