{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T02:51:28Z","timestamp":1719975088464},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,4,7]],"date-time":"2015-04-07T00:00:00Z","timestamp":1428364800000},"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":["J Intell Manuf"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10845-015-1075-z","type":"journal-article","created":{"date-parts":[[2015,4,6]],"date-time":"2015-04-06T01:55:54Z","timestamp":1428285354000},"page":"629-640","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Mathematical programming models for scheduling in a CPU\/FPGA architecture with heterogeneous communication delays"],"prefix":"10.1007","volume":"29","author":[{"given":"Abdessamad","family":"Ait El Cadi","sequence":"first","affiliation":[]},{"given":"Omar","family":"Souissi","sequence":"additional","affiliation":[]},{"given":"Rabie","family":"Ben Atitallah","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Belanger","sequence":"additional","affiliation":[]},{"given":"Abdelhakim","family":"Artiba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,7]]},"reference":[{"key":"1075_CR1","unstructured":"Ait El Cadi, A., (2004). Automatisation de la parall\u00e9lisation de syst\u00e8mes complexes avec application l\u2019environnement Matlab\/Simulink., Th\u00e8se (M.Sc.A.)-\u00c9cole Polytechnique de Montr\u00e9al."},{"key":"1075_CR2","unstructured":"Ali, H., & El-Rewini, H., (1990). 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"},{"key":"1075_CR3","doi-asserted-by":"crossref","DOI":"10.1002\/9780470451793","volume-title":"Principles of sequencing and scheduling","author":"KR Baker","year":"2009","unstructured":"Baker, K. R., & Trietsch, D. (2009). Principles of sequencing and scheduling. London: Wiley."},{"issue":"3","key":"1075_CR4","doi-asserted-by":"crossref","first-page":"583593","DOI":"10.1016\/j.engappai.2011.08.003","volume":"25","author":"A Banharnsakun","year":"2012","unstructured":"Banharnsakun, A., Sirinaovakul, B., & Achalakul, T. (2012). Job shop scheduling with the best-so-far ABC. Engineering Applications of Artificial Intelligence, 25(3), 583593.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"1075_CR5","doi-asserted-by":"crossref","first-page":"217225","DOI":"10.1080\/09537280601035836","volume":"18","author":"E Cakici","year":"2007","unstructured":"Cakici, E., & Mason, S. J. (2007). Parallel machine scheduling subject to auxiliary resource constraints. Production Planning and Control, 18, 217225.","journal-title":"Production Planning and Control"},{"key":"1075_CR6","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/j.jpdc.2009.04.011","volume":"69","author":"UV Catalyurek","year":"2009","unstructured":"Catalyurek, U. V., Boman, E. G., Devine, K. D., Bozda, D., Heaphy, R. T., & Riesen, L. A. (2009). A repartitioning hypergraph model for dynamic load balancing. Journal of Parallel and Distributed Computing, 69, 711\u2013724.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"3","key":"1075_CR7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0305-0548(99)00045-3","volume":"27","author":"WH Chen","year":"2000","unstructured":"Chen, W. H., & Lin, C. S. (2000). A hybrid heuristic to solve a task allocation problem. Computers and Operations Research, 27(3), 287\u2013303.","journal-title":"Computers and Operations Research"},{"key":"1075_CR8","first-page":"6590","volume-title":"Scheduling theory and its applications","author":"P Chr\u00e9tienne","year":"1995","unstructured":"Chr\u00e9tienne, P., & Picouleau, C. (1995). Scheduling with communication delays: A survey. In P. Chr\u00e9tienne, E. G. Coffman, J. K. Lenstra, & Z. Liu (Eds.), Scheduling theory and its applications (p. 6590). New York: Wiley."},{"key":"1075_CR9","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. (2000). Scheduling and automatic parallelization. Boston: Birkh\u00e4user."},{"issue":"3","key":"1075_CR10","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. (2003). Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine. Naval Research Logistics, 50(3), 273288.","journal-title":"Naval Research Logistics"},{"key":"1075_CR11","unstructured":"Davidovi\u0107, T., Liberti, L., Maculan, N., & Mladenovi\u0107, N., (2007). Towards the optimal solution of the multiprocessor scheduling problem with communication delays. In MISTA proceedings."},{"issue":"3","key":"1075_CR12","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. (2005). Permutation-based genetic, tabu and variable neigh-borhood search heuristics for multiprocessor scheduling with communication delays. Asia-Pacific Journal of Operational Research, 22(3), 297326.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"1075_CR13","volume-title":"Task scheduling in parallel and distributed systems","author":"H El-Rewini","year":"1994","unstructured":"El-Rewini, H., Ali, H. H., & Lewis, T. G. (1994). Task scheduling in parallel and distributed systems. Englewood Cliffs, NJ: Prentice-Hall."},{"issue":"9","key":"1075_CR14","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1109\/TC.1972.5009071","volume":"100","author":"M Flynn","year":"1972","unstructured":"Flynn, M. (1972). Some computer organizations and their effectiveness. IEEE Transactions on Computers, 100(9), 948\u2013960.","journal-title":"IEEE Transactions on Computers"},{"key":"1075_CR15","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. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Fran-cisco: WH Freeman & Co."},{"issue":"5","key":"1075_CR16","first-page":"849866","volume":"25","author":"M Gen","year":"2014","unstructured":"Gen, M., & Lin, L. (2014). Multiobjective evolutionary algorithm for manufacturing scheduling problems: State-of-the-art survey. Journal of Intelligent Manufacturing, 25(5), 849866.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"1075_CR17","doi-asserted-by":"publisher","unstructured":"Hao, X., Gen, M., Lin, L., & Suer, G. A. (2015). Effective multiobjective EDA for bi-criteria stochastic job-shop scheduling problem. Journal of Intelligent Manufacturig. doi:\n                        10.1007\/s10845-014-1026-0\n                        \n                    .","DOI":"10.1007\/s10845-014-1026-0"},{"key":"1075_CR18","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. (2000). Combinatorics and graph theory. New York: Springer."},{"key":"1075_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","volume":"207","author":"S Hartmann","year":"2010","unstructured":"Hartmann, S., & Briskorn, D. (2010). A survey of variants and extensions of the resource-constrained oroject scheduling problem. European Journal of Operational Research, 207, 1\u201314.","journal-title":"European Journal of Operational Research"},{"key":"1075_CR20","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1016\/j.micpro.2011.03.005","volume":"35","author":"GNT Huong","year":"2011","unstructured":"Huong, G. N. T., Na, Y., & Kim, S. W. (2011). Applying frame layout to hardware design in FPGA for seamless support of cross calls in CPU\u2013FPGA coupling architecture. Microprocessors and Microsystems, 35, 462\u2013472.","journal-title":"Microprocessors and Microsystems"},{"key":"1075_CR21","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. (2008). A comparison of multiprocessor task scheduling algorithms with communication costs. Computers & Operations Research, 35, 976993.","journal-title":"Computers & Operations Research"},{"key":"1075_CR22","doi-asserted-by":"crossref","first-page":"309316","DOI":"10.1007\/BF01108764","volume":"11","author":"G Isaak","year":"1994","unstructured":"Isaak, G. (1994). Scheduling rooted forests with communication delays. Order, 11, 309316.","journal-title":"Order"},{"key":"1075_CR23","first-page":"154169","volume":"67","author":"K Jong-Kook","year":"2007","unstructured":"Jong-Kook, K., Shivle, S., Siegel, H. J., Maciejewski, A. A., Braun, T. D., Schneider, M., et al. (2007). Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment. Journal of Parallel and Distributed Computing, 67, 154169.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"1075_CR24","volume-title":"The art of computer programming","author":"DE Knuth","year":"1997","unstructured":"Knuth, D. E. (1997). The art of computer programming (3rd ed., Vol. 1). Boston: Addison-Wesley.","edition":"3"},{"key":"1075_CR25","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.cor.2009.12.011","volume":"38","author":"O Kon\u00e9","year":"2011","unstructured":"Kon\u00e9, O., Artigues, C., Lopez, P., & Mongeau, M. (2011). Event-based MILP models for resource-constrained project scheduling problems. Computers & Operations Research, 38, 3\u201313.","journal-title":"Computers & Operations Research"},{"key":"1075_CR26","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.future.2008.07.001","volume":"25","author":"VV Korkhov","year":"2009","unstructured":"Korkhov, V. V., Moscicki, J. T., & Krzhizhanovskaya, V. V. (2009). Dynamic workload balancing of parallel applications with user-level scheduling on the grid. Future Generation Computer Systems, 25, 28\u201334.","journal-title":"Future Generation Computer Systems"},{"key":"1075_CR27","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1016\/j.simpat.2011.01.002","volume":"19","author":"Q Long","year":"2011","unstructured":"Long, Q., Lin, J., & Sun, Z. (2011). Agent scheduling model for adaptive dynamic load balancing in agent-based distributed simulations. Simulation Modelling Practice and Theory, 19, 1021\u20131034.","journal-title":"Simulation Modelling Practice and Theory"},{"key":"1075_CR28","first-page":"695714","volume":"67","author":"P Luo","year":"2007","unstructured":"Luo, P., L, K., & Shi, Z. (2007). A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems. Journal of Parallel and Distributed Computing, 67, 695714.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"1075_CR29","first-page":"1","volume":"26","author":"H Luo","year":"2013","unstructured":"Luo, H., Zhang, A., & Huang, G. Q. (2013). Active scheduling for hybrid flowshop with family setup time and inconsistent family formation. Journal of Intelligent Manufacturing, 26, 1\u201319.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"1075_CR30","volume-title":"Operations research: Deterministic optimization models","author":"KG Murty","year":"1994","unstructured":"Murty, K. G. (1994). Operations research: Deterministic optimization models. Englewood Cliffs, NJ: Prentice-Hall."},{"key":"1075_CR31","volume-title":"Scheduling: Theory, algorithms, and systems","author":"M Pinedo","year":"2002","unstructured":"Pinedo, M. (2002). Scheduling: Theory, algorithms, and systems (2nd ed.). New Jersey: Prentice-Hall.","edition":"2"},{"key":"1075_CR32","unstructured":"Prastein, M., (1987). Precedence-constrained scheduling with minimum time and communication, MS Thesis, University of Illinois at Urbana-Champaign."},{"key":"1075_CR33","first-page":"557","volume":"18","author":"VJ Rayward-Smith","year":"1987","unstructured":"Rayward-Smith, V. J. (1987). UET scheduling with unit interprocessor communication delays. Discrete Applied Mathematics, 18, 557.","journal-title":"Discrete Applied Mathematics"},{"key":"1075_CR34","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. (1992). A time-indexed formulation of nonpreemptive single machine scheduling problems. Mathematical Programming, 54, 353367.","journal-title":"Mathematical Programming"},{"key":"1075_CR35","doi-asserted-by":"crossref","first-page":"785800","DOI":"10.1016\/j.cie.2010.02.012","volume":"58","author":"Y Unlu","year":"2010","unstructured":"Unlu, Y., & Mason, S. J. (2010). Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems. Computers & Industrial Engineering, 58, 785800.","journal-title":"Computers & Industrial Engineering"},{"issue":"5","key":"1075_CR36","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1287\/mnsc.44.5.738","volume":"44","author":"TL Urban","year":"1998","unstructured":"Urban, T. L. (1998). Note. Optimal balancing of U-shaped assembly lines. Management Science, 44(5), 738\u2013741.","journal-title":"Management Science"},{"key":"1075_CR37","first-page":"1","volume":"26","author":"EP V\u00e1zquez","year":"2013","unstructured":"V\u00e1zquez, E. P., Calvo, M. P., & Ord\u00f3\u00f1ez, P. M. (2013). Learning process on priority rules to solve the RCMPSP. Journal of Intelligent Manufacturing, 26, 1\u201316.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"1075_CR38","first-page":"129138","volume-title":"Algorithms and architectures for parallel processing","author":"S Venugopalan","year":"2012","unstructured":"Venugopalan, S., & Sinnen, O. (2012). Optimal linear programming solutions for multiprocessor scheduling with communication delays. In Y. Xiang, I. Stojmenovic, B. O. Apduhan, G. Wang, K. Nakano, & A. Zomaya (Eds.), Algorithms and architectures for parallel processing (Vol. 7439, p. 129138). Heidelberg: Springer."},{"key":"1075_CR39","doi-asserted-by":"publisher","unstructured":"Zhang, S., & Wong, T. N. (2014). Integrated process planning and scheduling: An enhanced ant colony optimization heuristic with parameter tuning. Journal of Intelligent Manufacturing. doi:\n                        10.1007\/s10845-014-1023-3\n                        \n                    .","DOI":"10.1007\/s10845-014-1023-3"},{"key":"1075_CR40","doi-asserted-by":"publisher","unstructured":"Zhang, W., Xu, W., Liu, G., & Gen, M. (2015). An effective hybrid evolutionary algorithm for stochastic multiobjective assembly line balancing problem. Journal of Intelligent Manufacturing. doi:\n                        10.1007\/s10845-015-1037-5\n                        \n                    .","DOI":"10.1007\/s10845-015-1037-5"},{"issue":"5","key":"1075_CR41","doi-asserted-by":"crossref","first-page":"881897","DOI":"10.1007\/s10845-013-0814-2","volume":"25","author":"W Zhang","year":"2014","unstructured":"Zhang, W., Gen, M., & Jo, J. B. (2014). Hybrid sampling strategy-based multiobjective evolutionary algorithm for process planning and scheduling problem. Journal of Intelligent Manufacturing, 25(5), 881897.","journal-title":"Journal of Intelligent Manufacturing"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1075-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-015-1075-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1075-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1075-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:12:06Z","timestamp":1559268726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-015-1075-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,7]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["1075"],"URL":"https:\/\/doi.org\/10.1007\/s10845-015-1075-z","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,7]]}}}