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

Modeling and Scheduling a Constrained Flowshop in Distributed Manufacturing Environments

JOURNAL OF MANUFACTURING SYSTEMS 2024年 72卷 519-535页

作者： Wang, Bing-Tao Pan, Quan-Ke Gao, Liang Miao, Zhong-Hua Sang, Hong-Yan Shanghai Univ Sch Mechatron Engn & Automat Shanghai 200072 Peoples R China Liaocheng Univ Sch Comp Sci Liaocheng 252000 Peoples R China Huazhong Univ Sci & Technol State Key Lab Digital Mfg Equipment & Technol Wuhan 430074 Peoples R China

his paper addresses a constrained distributed flowshop scheduling problem (CDFSP) that widely exists in modern manufacturing industry but has not been investigated before. Different from the distributed flowshop scheduling problem (DFSP) in the literature, CDFSP considers that all jobs are grouped for processing efficiently, and part of the groups subject to production requirements have a common deadline while the others do not have such a constraint. This constraint not only increases the complexity of the problem but also makes many solutions generated by the existing algorithms infeasible. Therefore, in this paper, a mathematical model is first established for the CDFSP with makespan criterion. After that, we explore the problem-specific knowledge to exclude infeasible solutions, and provide an acceleration method to evaluate feasible solutions in the insertion neighborhood. By automatically selecting parameters to match different search stages, a self-adaptive cooperative iterated greedy algorithm is designed where re-insertion and re-destruction mechanisms are integrated to address the infeasible solutions caused by a paradox and greedy mechanism. A cooperative mechanism is proposed to strengthen the coordination between family scheduling and job scheduling. Finally, the comprehensive experiments verify the effectiveness of the proposed algorithmic components and self-adaptive mechanism, and demonstrate the significant superiority of the proposed algorithm over five state-of-the-art metaheuristics.

关键词： Distribulled flowshop Group technology Deadling iterated greedy algorithm Collaborative mechanism

来源：评论

学校读者我要写书评

暂无评论

Approximate model and algorithms for precast supply chain scheduling problem with time-dependent transportation times

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2023年第7期61卷 2057-2085页

作者： Xiong, Fuli Chen, Siyuan Ma, Zongfang Li, Linlin Xian Univ Architecture & Technol Sch Informat & Control Engn Xian Peoples R China

This paper focuses on the precast supply chain scheduling problem with time-dependent transportation time to minimise the total weighted tardiness (PSCSP_TDT |TWT). In the problem, an order sequence and several job sequences are to be determined simultaneously. At first, through in-depth analysis of problem structure and real data from a precast manufacturer, we approximate the problem into a three-stage order scheduling problem by combining the seven production stages into one differentiation stage, and then explore some useful properties of the schedules for the approximate problem. Subsequently, to solve the small instances for the PSCSP_TDT |TWT, we propose an approximate model-based hybrid dynamic programming and heuristic (AMHDPH) and obtain a lower bound as a by-product of the algorithm. For dealing with medium-or large instances, with considering the complexity of the problem, we propose four approximate model-based hybrid iterated greedy (AMHIG) algorithms by integration of constructive heuristics, structural properties of solutions, an iterated greedy, and a correction heuristic. Comprehensive computational results show that the AMHDPH generates tight lower bounds for small instances and solves the most of small instances to optimality within 60 seconds. Whereas the best AMHIG generates feasible solutions with an average optimality gap below 5 percent for around 70 percent instances.

关键词： Scheduling precast supply chain system approximate model iterated greedy algorithm time-dependent transportation times

来源：评论

学校读者我要写书评

暂无评论

Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment

引用

JOURNAL OF SCHEDULING 2024年第6期27卷 525-543页

作者： Hoffmann, Julius Neufeld, Janis S. Buscher, Udo Tech Univ Dresden Fac Business & Econ Chair Ind Management Helmholtzstr 10 D-01069 Dresden Germany Karlsruhe Inst Technol Inst Operat Res Discrete Optimizat & Logist Kaiserstr 89 D-76133 Karlsruhe Germany Otto von Guericke Univ Chair Operat Management Univ Pl 2 D-39106 Magdeburg Germany

The customer order scheduling problem has garnered considerable attention in the recent scheduling literature. It is assumed that each of several customer orders consists of several jobs, and each customer order is completed only if each job of the order is completed. In this paper, we consider the customer order scheduling problem in a machine environment where each customer places exactly one job on each machine. The objective is to minimize the earliness-tardiness, where tardiness is defined as the time an order is finished past its due date, and earliness is the time a job is finished before its due date or the completion time of the corresponding order, whichever is later. Even though the earliness-tardiness criterion is an important objective for just-in-time production, this problem has not been studied in the context of the customer order scheduling problem. We provide a mixed-integer linear programming (MILP) formulation for this problem and derive multiple problem properties. Furthermore, we develop six different heuristics for this problem configuration. They follow the structure of the iterated greedy algorithm and additionally use a refinement function in which they differ. In a computational experiment, the algorithms were compared with each other and outperformed a solver solution of the MILP, which proves their ability to efficiently solve the problem configuration.

关键词： Machine scheduling Customer order scheduling iterated greedy algorithm Metaheuristics Earliness-tardiness Dedicated machines

来源：评论

学校读者我要写书评

暂无评论

Local search-based metaheuristics for the robust distributed permutation flowshop problem

引用

APPLIED SOFT COMPUTING 2021年 105卷 107247-107247页

作者： Jing, Xue-Lei Pan, Quan-Ke Gao, Liang Shanghai Univ Sch Mechatron Engn & Automat Shanghai 200072 Peoples R China Liaocheng Univ Expt & Network Informat Ctr Liaocheng 252000 Shandong Peoples R China Liaocheng Univ Sch Comp Sci & Technol Liaocheng 252000 Shandong Peoples R China Huazhong Univ Sci & Technol State Key Lab Digital Mfg Equipment & Technol Wuhan 430074 Peoples R China

Distributed Permutation Flowshop Scheduling Problem (DPFSP) has become a hot issue in recent years. However, DPFSP with uncertain processing times (DPFSP_UPT) has not been addressed so far although real manufacturing systems often encounter various uncertain factors which make processing times uncertain. In this paper, two local-search based metaheuristics, i.e., an iterated greedy algorithm (sIG) and an iterated Local Search algorithm (sILS), are presented to solve the DPFSP_UPT with makespan criterion. A robust model of expect-risk rule is used to describe the DPFSP_UPT. A valid heuristic based on the well-known NEH heuristic is proposed to initialize sIG and sILS. An acceleration algorithm is adapted to save computational efforts. A destruction procedure with dynamic sizes is presented to enhance the exploration capability for sIG. A feature with the characteristic that small changes in the solution can preserve the properties of good solutions in the iterative process is applied by sILS. Both sIG and sILS use multiple local search methods to produce promising solutions by exploiting diverse search areas. Extensive experiments show that the proposed sIG and sILS perform significantly better than the five competing algorithms adapted in the literature, but there is no significant difference between sIG and sILS and each has its own advantages for different instances. (C) 2021 Elsevier B.V. All rights reserved.

关键词： Robust optimization Scenario iterated greedy algorithm iterated Local Search algorithm NEH heuristic

来源：评论

学校读者我要写书评

暂无评论

Minimizing the total completion time in a two-machine flowshop problem with time delays

引用

ENGINEERING OPTIMIZATION 2016年第7期48卷 1164-1181页

作者： Msakni, Mohamed Kais Khallouli, Wael Al-Salem, Mohamed Ladhari, Talel Qatar Univ Mech & Ind Engn Doha Qatar Umm Al Qura Univ Coll Business Umm Al Qura Saudi Arabia Univ Tunis Ecole Super Sci Econom & Commerciales Tunis Tunis Tunisia

This article proposes to solve the problem of minimizing the total completion time in a two-machine permutation flowshop environment in which time delays between the machines are considered. For this purpose, an enumeration algorithm based on the branch-and-bound framework is developed, which includes new lower and upper bounds as well as dominance rules. The computational study shows that problems with up to 40 jobs can be solved in a reasonable amount of time.

关键词： flowshop time lags lower bounds branch-and-bound iterated greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Cyclic scheduling of perishable products in parallel machine with release dates, due dates and deadlines

引用

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2014年第Oct.期156卷 1-12页

作者： Shirvani, Nargess Ruiz, Ruben Shadrokh, Shahram Sharif Univ Technol Dept Ind Engn Tehran Iran Univ Politecn Valencia Inst Tecnol Informat Ciudad Politecn Innovac Grp Sistemas Optimizac Aplicada Valencia 46022 Spain

This paper deals with a realistic cyclic scheduling problem in the food industry environment in which parallel machines are considered to process perishable jobs with given release dates, due dates and deadlines. Jobs are subject to post-production shelf life limitation and must be delivered to retailers during the corresponding time window bounded by due dates and deadlines. Both early and tardy jobs are penalized by partial weighted earliness/tardiness functions and the overall problem is to provide a cyclic schedule of minimum cost. A mixed integer programming model is proposed and a heuristic solution beside an iterated greedy algorithm is developed to generate good and feasible solutions for the problem. The proposed MIP, heuristic and iterated greedy produce a series of solutions covering a wide range of cases from slow optimal solutions to quick and approximated schedules. (C) 2014 Published by Elsevier B.V.

关键词： Parallel machine scheduling Perishable products Partial weighted earliness/tardiness Due date Deadline Release date iterated greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Minimizing makespan for flow shop scheduling problem with intermediate buffers by using hybrid approach of artificial immune system

引用

APPLIED SOFT COMPUTING 2015年 28卷 44-56页

作者： Abdollahpour, Sana Rezaeian, Javad Mazandaran Univ Sci & Technol Dept Ind Engn Babol Sar Iran

In this study, three new meta-heuristic algorithms artificial immune system (AIS), iterated greedy algorithm (IG) and a hybrid approach of artificial immune system (AIS-IG) are proposed to minimize maximum completion time (makespan) for the permutation flow shop scheduling problem with the limited buffers between consecutive machines. As known, this category of scheduling problem has wide application in the manufacturing and has attracted much attention in academic fields. Different from basic artificial immune systems, the proposed AIS-IG algorithm is combined with destruction and construction phases of iterated greedy algorithm to improve the local search ability. The performances of these three approaches were evaluated over Taillard, Carlier and Reeves benchmark problems. It is shown that the AIS-IG and AIS algorithms not only generate better solutions than all of the well-known meta heuristic approaches but also can maintain their quality for large scale problems. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Flow shop scheduling problem Limited buffers Artificial immune system iterated greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Metaheuristic algorithms for the hybrid flowshop scheduling problem

引用

COMPUTERS & OPERATIONS RESEARCH 2019年 111卷 177-196页

作者： Oztop, Hande Tasgetiren, M. Fatih Eliiyi, Deniz Tursel Pan, Quan-Ke Yasar Univ Dept Ind Engn TR-35100 Izmir Turkey Istinye Univ Ind & Syst Engn Dept TR-34010 Istanbul Turkey Huazhong Univ Sci & Technol State Key Lab Wuhan 430074 Hubei Peoples R China Izmir Bakircay Univ Dept Ind Engn TR-35665 Izmir Turkey Shanghai Univ Sch Mechatron Engn & Automat Shanghai 200072 Peoples R China

The hybrid flowshop scheduling problem (HFSP) has been widely studied in the literature, as it has many real-life applications in industry. Even though many solution approaches have been presented for the HFSP with makespan criterion, studies on HFSP with total flow time minimization have been rather limited. This study presents a mathematical model, four variants of iterated greedy algorithms and a variable block insertion heuristic for the HFSP with total flow time minimization. Based on the well-known NEH heuristic, an efficient constructive heuristic is also proposed, and compared with NEH. A detailed design of experiment is carried out to calibrate the parameters of the proposed algorithms. The HFSP benchmark suite is used for evaluating the performance of the proposed methods. As there are only 10 large instances in the current literature, further 30 large instances are proposed as new benchmarks. The developed model is solved for all instances on CPLEX under a time limit, and the performances of the proposed algorithms are assessed through comparisons with the results from CPLEX and the two best-performing algorithms in literature. Computational results show that the proposed algorithms are very effective in terms of solution time and quality. Additionally, the proposed algorithms are tested on large instances for the makespan criterion, which reveal that they also perform superbly for the makespan objective. Especially for instances with 30 jobs, the proposed algorithms are able to find the current incumbent makespan values reported in literature, and provide three new best solutions. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Hybrid flowshop scheduling Block insertion heuristic iterated greedy algorithm Makespan Total flow time

来源：评论

学校读者我要写书评

暂无评论

Using heuristic and iterative greedy algorithms for the total weighted completion time order scheduling with release times

引用

SWARM AND EVOLUTIONARY COMPUTATION 2019年 44卷 913-926页

作者： Wu, Chin-Chia Yang, Tzu-Hsuan Zhang, Xingong Kang, Chao-Chung Chung, I-Hong Lin, Win-Chin Feng Chia Univ Dept Stat Taichung 40724 Taiwan Chongqing Normal Univ Coll Math Sci Chongqing 401331 Peoples R China Providence Univ Dept Business Adm Taichung Taiwan

The customer order scheduling problem is becoming a major topic in the research community, but the research regarding customer order scheduling problems with ready times remains relatively limited. This study examined an order scheduling problem with ready times where the measurement criterion was minimizing the total weighted completion time of all the given orders. To solve this intractable problem, we first derived several dominance rules and two lower bounds to use in a branch-and-bound method for finding an exact solution. We then modified five existing heuristics and adopted an iterative greedy (IG) algorithm to determine a near-optimal solution. Specifically, we used a fixed proportion of destruction and a linear function of destruction in the IG algorithm. Pairwise improvement was applied to all the proposed heuristics to achieve high-quality solutions, and we performed one-way analysis of variance and Fisher's least significant difference tests to evaluate and compare the performance of all the proposed algorithms.

关键词： iterated greedy algorithm Order scheduling Ready times

来源：评论

学校读者我要写书评

暂无评论

A discrete differential evolution algorithm for the permutation flowshop scheduling problem

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2008年第4期55卷 795-816页

作者： Pan, Quan-Ke Tasgetiren, Mehmet Fatih Liang, Yun-Chia Sultan Qaboos Univ Dept Operat Management & Business Stat Muscat Oman Liaocheng Univ Coll Comp Sci Liaocheng Peoples R China Yuan Ze Univ Dept Ind Engn & Management Chungli 320 Taiwan

Very recently, Pan et al. [Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, GECC007, pp. 126-33] presented a new and novel discrete differential evolution algorithm for the permutation flowshop scheduling problem with the makespan criterion. On the other hand, the iterated greedy algorithm is proposed by [Ruiz, R.. & Stutzle, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177(3), 2033-49] for the permutation flowshop scheduling problem with the makespan criterion. However, both algorithms are not applied to the permutation flowshop scheduling problem with the total flowtime criterion. Based on their excellent performance with the makespan criterion, we extend both algorithms in this paper to the total flowtime objective. Furthermore, we propose a new and novel referenced local search procedure hybridized with both algorithms to further improve the solution quality. The referenced local search exploits the space based on reference positions taken from a reference solution in the hope of finding better positions for jobs when performing insertion operation. Computational results show that both algorithms with the referenced local search are either better or highly competitive to all the existing approaches in the literature for both objectives of makespan and total flowtime. Especially for the total flowtime criterion, their performance is superior to the particle swarm optimization algorithms proposed by [Tasgetiren, M. F., Liang, Y. -C., Sevkli, M., Gencyilmaz, G. (2007). Particle swarm optimization algorithm for makespan and total flowtime minimization in permutation flowshop sequencing problem. European journal of Operational Research, 177(3), 1930-47] and [Jarboui, B., Ibrahim, S., Siarry, P., Rebai, A. (2007). A combinatorial particle swarm optimisation for solving permutation flowshop problems. Computers & Industrial Engineeri

关键词： Permutation flowshop Scheduling iterated greedy algorithm Discrete differential evolution algorithm Discrete particle swarm optimization Referenced local search

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

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

请选择保存的检索档案：

请选择收藏分类：