检索结果-内蒙古大学图书馆

A mixed-integer non-linear no-wait open-shop scheduling model for minimizing makespan and total tardiness in manufacturing

引用

Decision Analytics Journal 2024年 10卷

作者： Mirmozaffari, Mirpouya Hejazi, Seyed Mojtaba Karamizadeh, Narges Montazeri, Arsalan Department of Industrial Engineering Dalhousie University 5269 Morris Street Halifax B3H 4R2 NS Canada Department of Data Science Rome Business School Rome Italy Department of Civil and Resource Engineering Dalhousie University 1360 Barrington Street Halifax B3H 4R2 NS Canada Northeastern University Department of project management First Canadian Place 100 King St W Toronto M5X 1E2 ON Canada

Open shop scheduling problems (OSSP) are highly significant in engineering and industry, involving critical scheduling challenges. The job type determines the duration required for material transfer between machines and remains unaffected by distance, eliminating any waiting time for transfers. This study also investigates machine-to-machine transfer durations, influenced by job types and independent of distance. The approach considers a transportation system allowing an unrestricted quantity of transportation machines, ensuring no delay is required for open shop scheduling during transfers. These specific scheduling problems are described as no-wait open shop scheduling problems (NWOSP). A mathematical model called mixed integer nonlinear programming models (MINLP) is utilized, employing the GAMS BONMIN solver for small and medium-scale problems to address smaller-scale instances of these problems. Three metaheuristic algorithms of Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), and Ant Lion Optimizer (ALO) are compared to resolve large-scale problems by considering a sorting function assisted by MATLAB to change the continuous metaheuristics environment to a permutation scheduling problem considering 250 iterations. Since metaheuristics are a theoretically powerful optimizer tool designed to expedite the resolution of intricate single-objective nonlinear problems and locate the most advantageous solution, reference point programming with euclidean distances (RPPED) is applied as the powerful tool for expediting the nonlinearity conditions and converting the bi-objective mixed integer linear programming (BOMILP) to suggested single objective MINLP. © 2024 The Author(s)

关键词： Ant Lion Optimizer Grey Wolf Optimizer Makespan Mixed integer nonlinear programming No-wait open shop scheduling problems reference point programming with euclidean distances Total tardiness Transportation time Whale Optimization Algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还