{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:07:03Z","timestamp":1750309623777,"version":"3.41.0"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,6,9]],"date-time":"2017-06-09T00:00:00Z","timestamp":1496966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2017,10,31]]},"abstract":"<jats:p>A large semiconductor product company spends hundreds of millions of dollars each year on design infrastructure to meet tapeout schedules for multiple concurrent projects. Resources (servers, electronic design automation tool licenses, engineers, and so on) are limited and must be shared -- and the cost per day of schedule slip can be enormous.<jats:italic>Co-constraints<\/jats:italic>between resource types (e.g., one license per every two cores (threads)) and dedicated versus shareable resource pools make scheduling and allocation hard. In this article, we formulate two mixed integer-linear programs for optimal multi-project, multi-resource allocation with task precedence and resource co-constraints. Application to a real-world three-project scheduling problem extracted from a leading-edge design center of anonymized Company X shows substantial compute and license costs savings. Compared to the product company, our solution shows that the makespan of schedule of all projects can be reduced by seven days, which not only saves \u223c 2.7% of annual labor and infrastructure costs but also enhances market competitiveness. We also demonstrate the capability of scheduling over two dozen chip development projects at the design center level, subject to resource and datacenter capacity limits as well as per-project penalty functions for schedule slips. The design center ended up purchasing 600 additional servers, whereas our solution demonstrates that the schedule can be met without having to purchase any additional servers. Application to a four-project scheduling problem extracted from a leading-edge design center in a non-US location shows availability of up to \u223c 37% headcount reduction during a half-year schedule for just one type of chip design activity.<\/jats:p>","DOI":"10.1145\/3035483","type":"journal-article","created":{"date-parts":[[2017,6,9]],"date-time":"2017-06-09T15:16:33Z","timestamp":1497021393000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Optimal Scheduling and Allocation for IC Design Management and Cost Reduction"],"prefix":"10.1145","volume":"22","author":[{"given":"Prabhav","family":"Agrawal","sequence":"first","affiliation":[{"name":"UC San Diego, La Jolla, CA"}]},{"given":"Mike","family":"Broxterman","sequence":"additional","affiliation":[{"name":"Qualcomm, Inc., Morehouse Drive, San Diego, CA"}]},{"given":"Biswadeep","family":"Chatterjee","sequence":"additional","affiliation":[{"name":"Qualcomm India Private Limited, Whitefield, Bangalore KA"}]},{"given":"Patrick","family":"Cuevas","sequence":"additional","affiliation":[{"name":"Qualcomm, Inc., Morehouse Drive, San Diego, CA"}]},{"given":"Kathy H.","family":"Hayashi","sequence":"additional","affiliation":[{"name":"Qualcomm, Inc., Morehouse Drive, San Diego, CA"}]},{"given":"Andrew B.","family":"Kahng","sequence":"additional","affiliation":[{"name":"UC San Diego, La Jolla, CA"}]},{"given":"Pranay K.","family":"Myana","sequence":"additional","affiliation":[{"name":"UC San Diego, La Jolla, CA"}]},{"given":"Siddhartha","family":"Nath","sequence":"additional","affiliation":[{"name":"UC San Diego, La Jolla, CA"}]}],"member":"320","published-online":{"date-parts":[[2017,6,9]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"P. Agrawal B. Chatterjee A. B. Kahng P. K. Myana and S. Nath. 2015. Optimal multi-tapeout project scheduling for enterprise-scale design management and cost reduction. Work-in-Progress DAC. P. Agrawal B. Chatterjee A. B. Kahng P. K. Myana and S. Nath. 2015. Optimal multi-tapeout project scheduling for enterprise-scale design management and cost reduction. Work-in-Progress DAC."},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"M. Ayala and C. Artigues. 2010. On Integer Linear Programming Formulations for the Resource-Constrained Modulo Scheduling Problem Rapport LAAS. Technical Report 10393. M. Ayala and C. Artigues. 2010. On Integer Linear Programming Formulations for the Resource-Constrained Modulo Scheduling Problem Rapport LAAS. Technical Report 10393.","DOI":"10.1016\/j.endm.2010.05.025"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-003-0155-1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"D. Bienstock and M. Zuckerberg. 2009. A new LP algorithm for precedence constrained production scheduling. Optimization Online 1--33. D. Bienstock and M. Zuckerberg. 2009. A new LP algorithm for precedence constrained production scheduling. Optimization Online 1--33.","DOI":"10.1007\/978-3-642-13036-6_1"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.09.006"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2014.6974675"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(87)90240-2"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/337292.337745"},{"volume-title":"Proceedings of International Conference on Advanced Communications and Computation. 81--89","author":"Friese R.","key":"e_1_2_1_9_1","unstructured":"R. Friese , T. Brinks , C. Oliver , H. J. Siegel , and A. A. Maciejewski . 2012. Analyzing the trade-offs between minimizing makespan and minimizing energy consumption in a heterogeneous resource allocation problem . In Proceedings of International Conference on Advanced Communications and Computation. 81--89 . R. Friese, T. Brinks, C. Oliver, H. J. Siegel, and A. A. Maciejewski. 2012. Analyzing the trade-offs between minimizing makespan and minimizing energy consumption in a heterogeneous resource allocation problem. In Proceedings of International Conference on Advanced Communications and Computation. 81--89."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED.2002.996728"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1080\/07408170902942683"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"R. Kolisch and S. Hartmann. 1999. Heuristic algorithms for the resource-constrained project scheduling problem: Classification and computational analysis. International Series in Operations Research 8 Management Science 14 147--178. R. Kolisch and S. Hartmann. 1999. Heuristic algorithms for the resource-constrained project scheduling problem: Classification and computational analysis. International Series in Operations Research 8 Management Science 14 147--178.","DOI":"10.1007\/978-1-4615-5533-9_7"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00170-1"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.41.10.1693"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(91)90081-H"},{"volume-title":"Multidisciplinary International Scheduling Conference, 276--284","author":"Laborie P.","key":"e_1_2_1_16_1","unstructured":"P. Laborie and D. Godard . 2007. Self-adapting large neighborhood search: Application to single-mode scheduling problems . Multidisciplinary International Scheduling Conference, 276--284 . P. Laborie and D. Godard. 2007. Self-adapting large neighborhood search: Application to single-mode scheduling problems. Multidisciplinary International Scheduling Conference, 276--284."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSME.2009.131"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSE.2014.356"},{"key":"e_1_2_1_19_1","unstructured":"S. Mohanty and M. K. Nayak. 2011. Optimization model in human resource management for job allocation in ICT project. International Journal of the Computer the Internet and Management 19 3 21--27. S. Mohanty and M. K. Nayak. 2011. Optimization model in human resource management for job allocation in ICT project. International Journal of the Computer the Internet and Management 19 3 21--27."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(01)00064-5"},{"key":"e_1_2_1_21_1","unstructured":"Qualcomm Inc. (IT project manager). 2014. Personal Communication. Qualcomm Inc. (IT project manager). 2014. Personal Communication."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10430-5_71"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00219-6"},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","unstructured":"G. Smith. 2014. Personal Communication. G. Smith. 2014. Personal Communication.","DOI":"10.1057\/9781137385420_6"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2014.6974676"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.28.10.1197"},{"key":"e_1_2_1_27_1","unstructured":"Cadence Assura QRC. Retrieved July 04 2016 from https:\/\/www.cadence.com\/content\/cadence-www\/global\/en US\/home\/tools\/digital-design-and-signoff.html. Cadence Assura QRC. Retrieved July 04 2016 from https:\/\/www.cadence.com\/content\/cadence-www\/global\/en US\/home\/tools\/digital-design-and-signoff.html."},{"key":"e_1_2_1_28_1","unstructured":"Cadence Innovus Implementation System. Retrieved July 4 2016 from https:\/\/www.cadence.com\/content\/cadence-www\/global\/en US\/home\/tools\/digital-design-and-signoff.html. Cadence Innovus Implementation System. Retrieved July 4 2016 from https:\/\/www.cadence.com\/content\/cadence-www\/global\/en US\/home\/tools\/digital-design-and-signoff.html."},{"key":"e_1_2_1_29_1","unstructured":"Cadence Tempus Timing Signoff. Retrieved July 4 2016 from https:\/\/www.cadence.com\/content\/cadence-www\/global\/en US\/home\/tools\/digital-design-and-signoff.html. Cadence Tempus Timing Signoff. Retrieved July 4 2016 from https:\/\/www.cadence.com\/content\/cadence-www\/global\/en US\/home\/tools\/digital-design-and-signoff.html."},{"key":"e_1_2_1_30_1","unstructured":"Dassault Systems Enovia Synchronicity. Retrieved July 8 2016 from http:\/\/www.3ds.com\/products-services\/enovia\/products\/v6\/synchronicity-designsync\/. Dassault Systems Enovia Synchronicity. Retrieved July 8 2016 from http:\/\/www.3ds.com\/products-services\/enovia\/products\/v6\/synchronicity-designsync\/."},{"key":"e_1_2_1_31_1","unstructured":"Glassdoor. Retrieved January 1 2017 from https:\/\/www.glassdoor.com\/Salaries\/index.htm. Glassdoor. Retrieved January 1 2017 from https:\/\/www.glassdoor.com\/Salaries\/index.htm."},{"key":"e_1_2_1_32_1","unstructured":"How Green is my Silicon Valley? Retrieved July 4 2016 from http:\/\/dac.com\/sites\/default\/files\/DACArchive\/pubs\/46DACFinal Prgm.pdf. How Green is my Silicon Valley? Retrieved July 4 2016 from http:\/\/dac.com\/sites\/default\/files\/DACArchive\/pubs\/46DACFinal Prgm.pdf."},{"key":"e_1_2_1_33_1","unstructured":"IBM ILOG CPLEX. Retrieved July 4 2016 from http:\/\/www-03.ibm.com\/software\/products\/en\/ibmilogcpleoptistud\/. IBM ILOG CPLEX. Retrieved July 4 2016 from http:\/\/www-03.ibm.com\/software\/products\/en\/ibmilogcpleoptistud\/."},{"key":"e_1_2_1_34_1","unstructured":"IC Manage. Retrieved July 8 2016 from https:\/\/www.icmanage.com\/ic-design-management-best-practices\/. IC Manage. Retrieved July 8 2016 from https:\/\/www.icmanage.com\/ic-design-management-best-practices\/."},{"key":"e_1_2_1_35_1","unstructured":"inMotion Creative Project Management. Retrieved July 4 2016 from http:\/\/explore.inmotionnow.com\/capterra-project-management. inMotion Creative Project Management. Retrieved July 4 2016 from http:\/\/explore.inmotionnow.com\/capterra-project-management."},{"key":"e_1_2_1_36_1","unstructured":"ITRS. Retrieved July 4 2016 from http:\/\/www.itrs2.net\/. ITRS. Retrieved July 4 2016 from http:\/\/www.itrs2.net\/."},{"key":"e_1_2_1_37_1","unstructured":"Nefelus Design Tools. Retrieved July 8 2016 from http:\/\/www.nefelus.com\/design-tools\/. Nefelus Design Tools. Retrieved July 8 2016 from http:\/\/www.nefelus.com\/design-tools\/."},{"key":"e_1_2_1_38_1","unstructured":"UCSD Design Cost Optimization Solver for Multi-Tapeout Project Scheduling. Retrieved July 4 2016 from http:\/\/vlsicad.ucsd.edu\/MILP\/. UCSD Design Cost Optimization Solver for Multi-Tapeout Project Scheduling. Retrieved July 4 2016 from http:\/\/vlsicad.ucsd.edu\/MILP\/."},{"key":"e_1_2_1_39_1","unstructured":"When The Chips are Down. Retrieved July 4 2016 from http:\/\/qz.com\/387490\/as-moores-law-turns-50-computer-chips-continue-to-get-cheaper-and-more-powerful\/. When The Chips are Down. Retrieved July 4 2016 from http:\/\/qz.com\/387490\/as-moores-law-turns-50-computer-chips-continue-to-get-cheaper-and-more-powerful\/."},{"key":"e_1_2_1_40_1","unstructured":"Platform Load Sharing Facility. Retrieved July 4 2016 from http:\/\/www-03.ibm.com\/systems\/services\/platformcomputing\/lsf.html. Platform Load Sharing Facility. Retrieved July 4 2016 from http:\/\/www-03.ibm.com\/systems\/services\/platformcomputing\/lsf.html."},{"key":"e_1_2_1_41_1","unstructured":"PSLIB Data Sets. Retrieved July 4 2016 from http:\/\/www.om-db.wi.tum.de\/psplib\/download.html. PSLIB Data Sets. Retrieved July 4 2016 from http:\/\/www.om-db.wi.tum.de\/psplib\/download.html."},{"key":"e_1_2_1_42_1","unstructured":"Runtime Design Automation. Retrieved July 4 2016 from http:\/\/www.rtda.com\/. Runtime Design Automation. Retrieved July 4 2016 from http:\/\/www.rtda.com\/."},{"key":"e_1_2_1_43_1","unstructured":"Qualcomm Snapdragon. Retrieved July 4 2016 from https:\/\/www.qualcomm.com\/products\/snapdragon. Qualcomm Snapdragon. Retrieved July 4 2016 from https:\/\/www.qualcomm.com\/products\/snapdragon."},{"key":"e_1_2_1_44_1","unstructured":"Salesforce Project Management. Retrieved July 8 2016 from https:\/\/www.salesforce.com\/. Salesforce Project Management. Retrieved July 8 2016 from https:\/\/www.salesforce.com\/."},{"key":"e_1_2_1_45_1","unstructured":"Samsung Exynos. Retrieved July 4 2016 from http:\/\/www.samsung.com\/semiconductor\/products\/exynos-solution\/application-processor\/. Samsung Exynos. Retrieved July 4 2016 from http:\/\/www.samsung.com\/semiconductor\/products\/exynos-solution\/application-processor\/."},{"key":"e_1_2_1_46_1","unstructured":"Synopsys IC Compiler. Retrieved July 4 2016 from http:\/\/www.synopsys.com\/Tools\/Implementation\/PhysicalImplementation\/Pages\/default.aspx. Synopsys IC Compiler. Retrieved July 4 2016 from http:\/\/www.synopsys.com\/Tools\/Implementation\/PhysicalImplementation\/Pages\/default.aspx."},{"key":"e_1_2_1_47_1","unstructured":"Synopsys PrimeTime. Retrieved July 4 2016 from http:\/\/www.synopsys.com\/Tools\/Implementation\/SignOff\/Pages\/PrimeTime.aspx. Synopsys PrimeTime. Retrieved July 4 2016 from http:\/\/www.synopsys.com\/Tools\/Implementation\/SignOff\/Pages\/PrimeTime.aspx."},{"key":"e_1_2_1_48_1","unstructured":"Synopsys Star-RCXT. Retrieved July 4 2016 from http:\/\/www.synopsys.com\/Tools\/Implementation\/SignOff\/Pages\/StarRC-ds.aspx. Synopsys Star-RCXT. Retrieved July 4 2016 from http:\/\/www.synopsys.com\/Tools\/Implementation\/SignOff\/Pages\/StarRC-ds.aspx."}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3035483","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3035483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T02:49:06Z","timestamp":1750301346000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3035483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,9]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,10,31]]}},"alternative-id":["10.1145\/3035483"],"URL":"https:\/\/doi.org\/10.1145\/3035483","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"type":"print","value":"1084-4309"},{"type":"electronic","value":"1557-7309"}],"subject":[],"published":{"date-parts":[[2017,6,9]]},"assertion":[{"value":"2016-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}