{"title":"通过电子表格上的线性规划识别项目调度中的关键活动的说明,附带教学注释","authors":"G. Light","doi":"10.34257/GJSFRFVOL21IS1PG1","DOIUrl":null,"url":null,"abstract":"This note presents a speedy resolution of the critical activities for the critical path method (CPM) in project management by first running Excel Solver to obtain the minimized time of the completion of the project in question and next perturbing the required times of all the involved activities concomitantly to reveal the critical activities by observing the difference in the minimized times. We use extensions of decimal places for the classroom demonstration of the above-said perturbation, and consider additions of log(prime numbers) to the required times of all the activities to serve any large-scale professional analyses without using tailored-made software. As a separate incidental pedagogical note, we show a heuristic approach to constructing exactly three constraints to yield positive optimal values for all the three decision variables in linear programming.","PeriodicalId":12547,"journal":{"name":"Global Journal of Science Frontier Research","volume":"49 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2021-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Note on Identifying Critical Activities in Project Scheduling via Linear Programming on Spreadsheets, with Incidental Pedagogical Remarks\",\"authors\":\"G. Light\",\"doi\":\"10.34257/GJSFRFVOL21IS1PG1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This note presents a speedy resolution of the critical activities for the critical path method (CPM) in project management by first running Excel Solver to obtain the minimized time of the completion of the project in question and next perturbing the required times of all the involved activities concomitantly to reveal the critical activities by observing the difference in the minimized times. We use extensions of decimal places for the classroom demonstration of the above-said perturbation, and consider additions of log(prime numbers) to the required times of all the activities to serve any large-scale professional analyses without using tailored-made software. As a separate incidental pedagogical note, we show a heuristic approach to constructing exactly three constraints to yield positive optimal values for all the three decision variables in linear programming.\",\"PeriodicalId\":12547,\"journal\":{\"name\":\"Global Journal of Science Frontier Research\",\"volume\":\"49 1\",\"pages\":\"1-5\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-02-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Global Journal of Science Frontier Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.34257/GJSFRFVOL21IS1PG1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Global Journal of Science Frontier Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.34257/GJSFRFVOL21IS1PG1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Note on Identifying Critical Activities in Project Scheduling via Linear Programming on Spreadsheets, with Incidental Pedagogical Remarks
This note presents a speedy resolution of the critical activities for the critical path method (CPM) in project management by first running Excel Solver to obtain the minimized time of the completion of the project in question and next perturbing the required times of all the involved activities concomitantly to reveal the critical activities by observing the difference in the minimized times. We use extensions of decimal places for the classroom demonstration of the above-said perturbation, and consider additions of log(prime numbers) to the required times of all the activities to serve any large-scale professional analyses without using tailored-made software. As a separate incidental pedagogical note, we show a heuristic approach to constructing exactly three constraints to yield positive optimal values for all the three decision variables in linear programming.