{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T06:34:55Z","timestamp":1722062095212},"reference-count":44,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1016\/j.jpdc.2020.07.005","type":"journal-article","created":{"date-parts":[[2020,8,6]],"date-time":"2020-08-06T01:44:16Z","timestamp":1596678256000},"page":"158-174","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Optimal task scheduling benefits from a duplicate-free state-space"],"prefix":"10.1016","volume":"146","author":[{"given":"Michael","family":"Orr","sequence":"first","affiliation":[]},{"given":"Oliver","family":"Sinnen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.jpdc.2020.07.005_b1","first-page":"185","article-title":"Improved bounds on Bell numbers and on moments of sums of random variables","volume":"30","author":"Berend","year":"2010","journal-title":"Probab. Math. Statist."},{"issue":"4","key":"10.1016\/j.jpdc.2020.07.005_b2","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1023\/A:1009725216438","article-title":"A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems","volume":"2","author":"Borchers","year":"1998","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.jpdc.2020.07.005_b3","series-title":"Branch-And-Bound Applications in Combinatorial Data Analysis","author":"Brusco","year":"2006"},{"key":"10.1016\/j.jpdc.2020.07.005_b4","series-title":"Catalogue of Artificial Intelligence Tools","first-page":"12","article-title":"Branch-and-bound algorithms","author":"Bundy","year":"1984"},{"key":"10.1016\/j.jpdc.2020.07.005_b5","series-title":"The foundations of thread-level parallelism in the supermatrix runtime system","author":"Chan","year":"2009"},{"key":"10.1016\/j.jpdc.2020.07.005_b6","first-page":"1","article-title":"Parallel branch-and-bound algorithms","volume":"1","author":"Crainic","year":"2006","journal-title":"Parallel Comb. Optim."},{"issue":"8","key":"10.1016\/j.jpdc.2020.07.005_b7","doi-asserted-by":"crossref","first-page":"2155","DOI":"10.1016\/j.cor.2005.01.005","article-title":"Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems","volume":"33","author":"Davidovi\u0107","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.jpdc.2020.07.005_b8","series-title":"Scheduling for Parallel Processing","author":"Drozdowski","year":"2009"},{"key":"10.1016\/j.jpdc.2020.07.005_b9","first-page":"1","article-title":"New MIP model for multiprocessor scheduling problem with communication delays","author":"El\u00a0Cadi","year":"2014","journal-title":"Optim. Lett."},{"issue":"4","key":"10.1016\/j.jpdc.2020.07.005_b10","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/0743-7315(92)90012-C","article-title":"A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors","volume":"16","author":"Gerasoulis","year":"1992","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.jpdc.2020.07.005_b11","series-title":"Twenty-Third International Joint Conference on Artificial Intelligence","article-title":"Isomorph-free branch and bound search for finite state controllers","author":"Grzes","year":"2013"},{"issue":"7","key":"10.1016\/j.jpdc.2020.07.005_b12","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/j.parco.2005.04.002","article-title":"A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems","volume":"31","author":"Hagras","year":"2005","journal-title":"Parallel Comput."},{"issue":"2","key":"10.1016\/j.jpdc.2020.07.005_b13","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"SSC-4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst., Sci., Cybernet."},{"issue":"2","key":"10.1016\/j.jpdc.2020.07.005_b14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1002\/wics.18","article-title":"Cholesky factorization","volume":"1","author":"Higham","year":"2009","journal-title":"Wiley Interdiscip. Rev. Comput. Stat."},{"issue":"2","key":"10.1016\/j.jpdc.2020.07.005_b15","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1137\/0218016","article-title":"Scheduling precedence graphs in systems with interprocessor communication times","volume":"18","author":"Hwang","year":"1989","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.jpdc.2020.07.005_b16","first-page":"16","article-title":"On the computational efficiency of branch-and-bound algorithms","volume":"20","author":"Ibaraki","year":"1977","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"10.1016\/j.jpdc.2020.07.005_b17","series-title":"Montage: a grid portal and software toolkit for science-grade astronomical image mosaicking","author":"Jacob","year":"2010"},{"issue":"9","key":"10.1016\/j.jpdc.2020.07.005_b18","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1287\/mnsc.13.9.723","article-title":"A branch and bound algorithm for the knapsack problem","volume":"13","author":"Kolesar","year":"1967","journal-title":"Manage. Sci."},{"key":"10.1016\/j.jpdc.2020.07.005_b19","unstructured":"R.E. Korf, L.A. Taylor, Finding optimal solutions to the twenty-four puzzle, in: Proceedings of the National Conference on Artificial Intelligence, 1996, pp. 1202\u20131207."},{"issue":"1","key":"10.1016\/j.jpdc.2020.07.005_b20","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1002\/cpe.1467","article-title":"Scheduling dense linear algebra operations on multicore processors","volume":"22","author":"Kurzak","year":"2010","journal-title":"Concurr. Comput.: Pract. Exper."},{"issue":"5","key":"10.1016\/j.jpdc.2020.07.005_b21","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/71.503776","article-title":"Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors","volume":"7","author":"Kwok","year":"1996","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.jpdc.2020.07.005_b22","series-title":"Proc. of Int. Par. Processing Symposium\/Symposium on Par. and Distributed Processing (IPPS\/SPDP-98)","first-page":"531","article-title":"Benchmarking the task graph scheduling algorithms","author":"Kwok","year":"1998"},{"issue":"12","key":"10.1016\/j.jpdc.2020.07.005_b23","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1016\/j.jpdc.2005.05.028","article-title":"On multiprocessor task scheduling using efficient state space search approaches","volume":"65","author":"Kwok","year":"2005","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"10.1016\/j.jpdc.2020.07.005_b24","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/JAS.2017.7510415","article-title":"Collision-free scheduling of multi-bridge machining systems: a colored traveling salesman problem-based approach","volume":"5","author":"Li","year":"2017","journal-title":"IEEE\/CAA J. Autom. Sin."},{"issue":"10","key":"10.1016\/j.jpdc.2020.07.005_b25","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions of the traveling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/j.jpdc.2020.07.005_b26","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.cor.2017.08.012","article-title":"Satisfiability modulo theory (smt) formulation for optimal scheduling of task graphs with communication delay","volume":"89","author":"Malik","year":"2018","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.jpdc.2020.07.005_b27","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1007\/s10878-017-0199-9","article-title":"Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays","volume":"36","author":"Mallach","year":"2018","journal-title":"J. Comb. Optim."},{"issue":"1","key":"10.1016\/j.jpdc.2020.07.005_b28","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/0105003","article-title":"Algorithms for the assignment and transportation problems","volume":"5","author":"Munkres","year":"1957","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"10.1016\/j.jpdc.2020.07.005_b29","series-title":"European Conference on Parallel Processing","first-page":"97","article-title":"A duplicate-free state-space model for optimal task scheduling","author":"Orr","year":"2015"},{"key":"10.1016\/j.jpdc.2020.07.005_b30","series-title":"Handbook of Combinatorial Optimization","first-page":"1077","article-title":"The graph coloring problem: A bibliographic survey","author":"Pardalos","year":"1998"},{"issue":"5","key":"10.1016\/j.jpdc.2020.07.005_b31","doi-asserted-by":"crossref","first-page":"959","DOI":"10.2478\/s12175-013-0147-9","article-title":"Closures on partial partitions from closures on sets","volume":"63","author":"Ronse","year":"2013","journal-title":"Math. Slovaca"},{"key":"10.1016\/j.jpdc.2020.07.005_b32","series-title":"Partitioning and Scheduling Parallel Programs for Multiprocessors","author":"Sarkar","year":"1989"},{"issue":"3","key":"10.1016\/j.jpdc.2020.07.005_b33","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/s11227-010-0395-1","article-title":"Scheduling task graphs optimally with A*","volume":"51","author":"Semar Shahul","year":"2010","journal-title":"J. Supercomput."},{"key":"10.1016\/j.jpdc.2020.07.005_b34","series-title":"Task Scheduling for Parallel Systems (Wiley Series on Parallel and Distributed Computing)","author":"Sinnen","year":"2007"},{"key":"10.1016\/j.jpdc.2020.07.005_b35","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.cor.2013.09.004","article-title":"Reducing the solution space of optimal task scheduling","volume":"43","author":"Sinnen","year":"2014","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.jpdc.2020.07.005_b36","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.cor.2013.09.004","article-title":"Reducing the solution space of optimal task scheduling","volume":"43","author":"Sinnen","year":"2014","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"10.1016\/j.jpdc.2020.07.005_b37","doi-asserted-by":"crossref","first-page":"733","DOI":"10.4153\/CMB-1974-132-8","article-title":"On some numbers related to the bell numbers","volume":"17","author":"Stephen","year":"1975","journal-title":"Canad. Math. Bull."},{"issue":"2\u20133","key":"10.1016\/j.jpdc.2020.07.005_b38","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-8191(90)90056-F","article-title":"Multiprocessor scheduling with communication delays","volume":"16","author":"Veltman","year":"1990","journal-title":"Parallel Comput."},{"issue":"1","key":"10.1016\/j.jpdc.2020.07.005_b39","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1109\/TPDS.2014.2308175","article-title":"Integer linear programming for the multiprocessor scheduling problem with communication delays","volume":"16","author":"Venugopalan","year":"2015","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"10.1016\/j.jpdc.2020.07.005_b40","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1080\/07408178408974695","article-title":"An algorithm for NC turret punch press tool location and hit sequencing","volume":"16","author":"Walas","year":"1984","journal-title":"IIE Trans."},{"issue":"8","key":"10.1016\/j.jpdc.2020.07.005_b41","doi-asserted-by":"crossref","first-page":"1736","DOI":"10.1109\/TPDS.2018.2808959","article-title":"List-scheduling versus cluster-scheduling","volume":"29","author":"Wang","year":"2018","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"10.1016\/j.jpdc.2020.07.005_b42","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/71.80160","article-title":"Hypertool: A programming aid for message-passing systems","volume":"1","author":"Wu","year":"1990","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"12","key":"10.1016\/j.jpdc.2020.07.005_b43","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1016\/0167-8191(93)90079-Z","article-title":"List scheduling with and without communication delays","volume":"19","author":"Yang","year":"1993","journal-title":"Parallel Comput."},{"key":"10.1016\/j.jpdc.2020.07.005_b44","series-title":"State-Space Search: algorithms, Complexity, Extensions, and Applications","author":"Zhang","year":"1999"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731520303348?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731520303348?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T15:25:35Z","timestamp":1601479535000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731520303348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":44,"alternative-id":["S0743731520303348"],"URL":"https:\/\/doi.org\/10.1016\/j.jpdc.2020.07.005","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2020,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal task scheduling benefits from a duplicate-free state-space","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jpdc.2020.07.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}