This study proposes a novel approach to optimizing individual work schedules for book digitization using mixed-integer programming (MIP). By leveraging the power of MIP solvers, we aimed to minimize the overall digiti...This study proposes a novel approach to optimizing individual work schedules for book digitization using mixed-integer programming (MIP). By leveraging the power of MIP solvers, we aimed to minimize the overall digitization time while considering various constraints and process dependencies. The book digitization process involves three key steps: cutting, scanning, and binding. Each step has specific requirements and limitations such as the number of pages that can be processed simultaneously and potential bottlenecks. To address these complexities, we formulate the problem as a one-machine job shop scheduling problem with additional constraints to capture the unique characteristics of book digitization. We conducted a series of experiments to evaluate the performance of our proposed approach. By comparing the optimized schedules with the baseline approach, we demonstrated significant reductions in the overall processing time. In addition, we analyzed the impact of different weighting schemes on the optimization results, highlighting the importance of identifying and prioritizing critical processes. Our findings suggest that MIP-based optimization can be a valuable tool for improving the efficiency of individual work schedules, even in seemingly simple tasks, such as book digitization. By carefully considering specific constraints and objectives, we can save time and leverage resources by carefully considering specific constraints and objectives.展开更多
The construction projects’ dynamic and interconnected nature requires a comprehensive understanding of complexity during pre-construction. Traditional tools such as Gantt charts, CPM, and PERT often overlook uncertai...The construction projects’ dynamic and interconnected nature requires a comprehensive understanding of complexity during pre-construction. Traditional tools such as Gantt charts, CPM, and PERT often overlook uncertainties. This study identifies 20 complexity factors through expert interviews and literature, categorising them into six groups. The Analytical Hierarchy Process evaluated the significance of different factors, establishing their corresponding weights to enhance adaptive project scheduling. A system dynamics (SD) model is developed and tested to evaluate the dynamic behaviour of identified complexity factors. The model simulates the impact of complexity on total project duration (TPD), revealing significant deviations from initial deterministic estimates. Data collection and analysis for reliability tests, including normality and Cronbach alpha, to validate the model’s components and expert feedback. Sensitivity analysis confirmed a positive relationship between complexity and project duration, with higher complexity levels resulting in increased TPD. This relationship highlights the inadequacy of static planning approaches and underscores the importance of addressing complexity dynamically. The study provides a framework for enhancing planning systems through system dynamics and recommends expanding the model to ensure broader applicability in diverse construction projects.展开更多
以刊载景观规划研究论文的重要期刊Landscape and Urban Planning为研究对象,从论文来源地、撰稿人所属单位、文章属性、研究内容与研究对象等几个方面对该期刊刊载的1604篇文章进行分析,揭示出国际景观规划研究20年来的规律、特征、重...以刊载景观规划研究论文的重要期刊Landscape and Urban Planning为研究对象,从论文来源地、撰稿人所属单位、文章属性、研究内容与研究对象等几个方面对该期刊刊载的1604篇文章进行分析,揭示出国际景观规划研究20年来的规律、特征、重点和热点等,为国内学界了解与把握国际景观规划研究动态提供帮助。展开更多
At present, most commercial computer-aided manufacturing （CAM） systems are deficient in efficiency and performances on generating tool path during machining impellers. To solve the problem, this article develops a s...At present, most commercial computer-aided manufacturing （CAM） systems are deficient in efficiency and performances on generating tool path during machining impellers. To solve the problem, this article develops a special software to plan cutting path for ruled surface impellers. An approximation algorithm to generate cutting path for machining integral ruled surface impellers is proposed. By fitting sampling data points of an impeller blade into a curve, a model of ruled surface blade of an impeller is built up. Furthermore, by calculating the points where the cutter axis vector intersects the free-form hub surface of an impeller, problems about, for instance, the ambiguity in calculation and machining the wide blade surface with a short flute cutter are solved. Finally, an integral impeller cutting path is planned by way of an integrated cutter location control algorithm. Simulation and machining tests with an impeller are performed on a 5-axis computer numerically controlled （CNC） mill machine, which shows the feasibility of the proposed algorithm.展开更多
文摘This study proposes a novel approach to optimizing individual work schedules for book digitization using mixed-integer programming (MIP). By leveraging the power of MIP solvers, we aimed to minimize the overall digitization time while considering various constraints and process dependencies. The book digitization process involves three key steps: cutting, scanning, and binding. Each step has specific requirements and limitations such as the number of pages that can be processed simultaneously and potential bottlenecks. To address these complexities, we formulate the problem as a one-machine job shop scheduling problem with additional constraints to capture the unique characteristics of book digitization. We conducted a series of experiments to evaluate the performance of our proposed approach. By comparing the optimized schedules with the baseline approach, we demonstrated significant reductions in the overall processing time. In addition, we analyzed the impact of different weighting schemes on the optimization results, highlighting the importance of identifying and prioritizing critical processes. Our findings suggest that MIP-based optimization can be a valuable tool for improving the efficiency of individual work schedules, even in seemingly simple tasks, such as book digitization. By carefully considering specific constraints and objectives, we can save time and leverage resources by carefully considering specific constraints and objectives.
文摘The construction projects’ dynamic and interconnected nature requires a comprehensive understanding of complexity during pre-construction. Traditional tools such as Gantt charts, CPM, and PERT often overlook uncertainties. This study identifies 20 complexity factors through expert interviews and literature, categorising them into six groups. The Analytical Hierarchy Process evaluated the significance of different factors, establishing their corresponding weights to enhance adaptive project scheduling. A system dynamics (SD) model is developed and tested to evaluate the dynamic behaviour of identified complexity factors. The model simulates the impact of complexity on total project duration (TPD), revealing significant deviations from initial deterministic estimates. Data collection and analysis for reliability tests, including normality and Cronbach alpha, to validate the model’s components and expert feedback. Sensitivity analysis confirmed a positive relationship between complexity and project duration, with higher complexity levels resulting in increased TPD. This relationship highlights the inadequacy of static planning approaches and underscores the importance of addressing complexity dynamically. The study provides a framework for enhancing planning systems through system dynamics and recommends expanding the model to ensure broader applicability in diverse construction projects.
文摘以刊载景观规划研究论文的重要期刊Landscape and Urban Planning为研究对象,从论文来源地、撰稿人所属单位、文章属性、研究内容与研究对象等几个方面对该期刊刊载的1604篇文章进行分析,揭示出国际景观规划研究20年来的规律、特征、重点和热点等,为国内学界了解与把握国际景观规划研究动态提供帮助。
基金Key Development Program of Science and Technology of Heilongjiang Province, China (GB05A501)
文摘At present, most commercial computer-aided manufacturing （CAM） systems are deficient in efficiency and performances on generating tool path during machining impellers. To solve the problem, this article develops a special software to plan cutting path for ruled surface impellers. An approximation algorithm to generate cutting path for machining integral ruled surface impellers is proposed. By fitting sampling data points of an impeller blade into a curve, a model of ruled surface blade of an impeller is built up. Furthermore, by calculating the points where the cutter axis vector intersects the free-form hub surface of an impeller, problems about, for instance, the ambiguity in calculation and machining the wide blade surface with a short flute cutter are solved. Finally, an integral impeller cutting path is planned by way of an integrated cutter location control algorithm. Simulation and machining tests with an impeller are performed on a 5-axis computer numerically controlled （CNC） mill machine, which shows the feasibility of the proposed algorithm.
