4.7 Article

Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization

期刊

COMPUTERS & INDUSTRIAL ENGINEERING
卷 135, 期 -, 页码 79-104

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2019.05.034

关键词

Scheduling; No-wait flow shop; Dependent-sequence setup times; Preventive maintenance; Constructive heuristics

资金

  1. Coordenacao de Aperfeicoamento de Pessoal de Nivel Superior (CAPES), Brazil [001]
  2. Conselho Nacional de Desenvolvimento Cientifico e Tecnologico (CNPq), Brazil [306075/2017-2, 430137/2018-4]

向作者/读者索取更多资源

In this paper, preventive maintenance (PM) operations are incorporated as a constraint to the m-machine no-wait flow shop problem with dependent-sequence setup times and makespan minimization scheduling problem. PM are based on the concept of flexible and diverse maintenance levels (ML). Flexibility means that PM activities can be carried out in other periods besides the pre-determined. In order to ensure the diversity of each ML is determined according to different parameters of a PM policy based on Weibull distribution. A MILP is proposed to describe the problem. A procedure to assign PM activity in the sequence of jobs are proposed. As solution methods for the problem, the main constructive heuristics for the m-machine no-wait flow shop with makespan minimization are implemented in the original and adapted versions to solve small and large problem sizes. Computational results show that LWW and FCH are the best heuristics regarding the quality of solution in large problem sizes and generate the better results in small sizes, compared with the MILP solutions. In comparison with other procedures to scheduling PM operations to the sequence of jobs, the proposed procedure generates better results in all large problem sizes.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Engineering, Multidisciplinary

An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time

Marcelo Seido Nagano, Fernando Siqueira de Almeida, Hugo Hissashi Miyata

Summary: This article proposes an iterated greedy-with-local-search algorithm for the no-wait flowshop scheduling problem, which outperforms both the mathematical model and the best existing algorithm in terms of effectiveness and efficiency according to computational experiments and statistical analysis.

ENGINEERING OPTIMIZATION (2021)

Article Management

Effect of price reduction on renewable energy technology supply chain performance and contract design

Chuanhui Xiong, Anna G. Devlin, Jatinder N. D. Gupta, Xiangrong Liu

Summary: Global electricity generation has been dominated by fossil fuel sources, particularly coal, over the past decade. The rising concerns over pollution emissions and growing commitment to environmental change have led to a surge in clean and renewable energy. However, the sharp reduction in the price of renewable energy technology like solar PV panels has created challenges for manufacturers and retailers, causing inefficiencies in supply chains.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2022)

Article Computer Science, Interdisciplinary Applications

Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times

Fernando Luis Rossi, Marcelo Seido Nagano

Summary: The distributed permutation flowshop scheduling problem (DPFSP) has been widely studied due to the complex production systems with mixed no-idle flowshops. Although the issue of identical factories with mixed no-idle flowshop environments has not been explored in literature, new solutions including MILP formulation, constructive heuristic, and iterated greedy algorithms have been proposed. Extensive experiments showed that the proposed methods outperformed existing approaches.

COMPUTERS & INDUSTRIAL ENGINEERING (2021)

Article Automation & Control Systems

A new efficient biased random key genetic algorithm for open shop scheduling with routing by capacitated single vehicle and makespan minimization

Levi R. Abreu, Roberto F. Tavares-Neto, Marcelo S. Nagano

Summary: In this paper, a new biased random key genetic algorithm with an iterated greedy local search procedure (BRKGA-IG) is proposed for solving open shop scheduling with routing by capacitated vehicles. The algorithm combines approximation and exact algorithms to achieve high-quality solutions in acceptable computational times. The extensive computational experiments demonstrate that the proposed metaheuristic BRKGA-IG outperforms all other tested methods, showing promise in solving large-sized instances for the new proposed problem.

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2021)

Article Engineering, Multidisciplinary

A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions

Levi Ribeiro de Abreu, Kennedy Anderson Guimaraes Araujo, Bruno de Athayde Prata, Marcelo Seido Nagano, Joao Vitor Moccellin

Summary: This article introduces a new variant of the open shop scheduling problem, known as the open shop scheduling problem with repetitions (OSSPR), which has many applications in automotive and maintenance activities. By presenting a mixed-integer linear programming model and a new constraint programming model, along with a new efficient variable neighbourhood search method, the NP-hard problem is effectively solved with excellent performance shown in computational results.

ENGINEERING OPTIMIZATION (2022)

Article Information Science & Library Science

On the relation between knowledge management and university-industry-government collaboration in Brazilian national institutes of science and technology

Suzana Xavier Ribeiro, Marcelo Seido Nagano

Summary: This study investigates the relation between knowledge management and university-industry-government collaboration in influencing organizations' performance, focusing on the Brazilian context. An analytical model is proposed, considering structural, relational, cognitive, and contextual dimensions. The findings show that organizational structure, relationships, and cognition play important roles in knowledge flow and sharing, while the context also has an impact. Cultural differences, bureaucracy, and socio-economic reality are identified as main obstacles, while the presence of technology parks, incubators, government incentives, and geographical proximity are facilitators.

VINE JOURNAL OF INFORMATION AND KNOWLEDGE MANAGEMENT SYSTEMS (2023)

Article Computer Science, Interdisciplinary Applications

Improving supplier capability through training: Evidence from the Chinese Automobile Industry

Vincent F. Yu, Meng Qiu, Jatinder N. D. Gupta

Summary: Supplier training is essential for enhancing their capabilities to meet OEMs' needs. This study used the MMOG/LE framework to identify training needs and design a curriculum, resulting in improved supplier capabilities perceptions after training. This demonstrates the effectiveness of supplier training in improving performance and success within a supply chain.

COMPUTERS & INDUSTRIAL ENGINEERING (2022)

Article Green & Sustainable Science & Technology

Sustainable microgrid design with multiple demand areas and peer-to-peer energy trading involving seasonal factors and uncertainties

Vincent F. Yu, Thi Huynh Anh Le, Jatinder N. D. Gupta

Summary: This paper investigates the sustainable microgrid design problem with multiple types of demand areas, peer-to-peer energy trading, and seasonal factors. By developing a fuzzy multi-objective programming model and applying a genetic algorithm, the proposed model achieves significant improvements in increasing total profit and reducing environmental costs.

RENEWABLE & SUSTAINABLE ENERGY REVIEWS (2022)

Article Mathematics

Robust Scheduling of Two-Agent Customer Orders with Scenario-Dependent Component Processing Times and Release Dates

Chin-Chia Wu, Jatinder N. D. Gupta, Win-Chin Lin, Shuenn-Ren Cheng, Yen-Lin Chiu, Juin-Han Chen, Long-Yuan Lee

Summary: This paper addresses the customer order scheduling problem involving two agents in uncertain environments. It proposes a branch-and-bound algorithm and several heuristics to find optimal or approximate solutions. The empirical evaluation demonstrates the effectiveness of the proposed methods in finding good solutions.

MATHEMATICS (2022)

Article Computer Science, Interdisciplinary Applications

Scheduling identical parallel batch processing machines involving incompatible families with different job sizes and capacity constraints

Chunhao Li, Feng Wang, Jatinder N. D. Gupta, Tsuiping Chung

Summary: This paper investigates the problem of scheduling jobs on parallel batch processing machines with incompatible job families, non-identical job sizes, arbitrary job release times, and machine capacity constraints. It proposes a new algorithm that can obtain better solutions than existing algorithms.

COMPUTERS & INDUSTRIAL ENGINEERING (2022)

Article Engineering, Industrial

The shunting scheduling of EMU first-level maintenance in a stub-end depot

Ming He, Qiuhua Tang, Jatinder N. D. Gupta, Di Yin, Zikai Zhang

Summary: This paper proposes a solution to the EMU first-level maintenance shunting scheduling problem with flexible maintenance routes in a stub-end depot. By formulating a multi-objective MILP model and using a heuristic-based enhanced particle swarm optimization algorithm (EPSO), an approximate optimal schedule is achieved. Experimental results demonstrate the effectiveness and efficiency of the algorithm.

FLEXIBLE SERVICES AND MANUFACTURING JOURNAL (2023)

Review Computer Science, Interdisciplinary Applications

A Comprehensive Review of Bat Inspired Algorithm: Variants, Applications, and Hybridization

Mohammad Shehab, Muhannad A. Abu-Hashem, Mohd Khaled Yousef Shambour, Ahmed Izzat Alsalibi, Osama Ahmad Alomari, Jatinder N. D. Gupta, Anas Ratib Alsoud, Belal Abuhaija, Laith Abualigah

Summary: This article provides a comprehensive review of the Bat algorithm (BA) and evaluates its characteristics in comparison with other optimization algorithms. It highlights the performance and variations of BA in different applications and suggests future research directions.

ARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING (2023)

Article Engineering, Industrial

Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function

Hugo Hissashi Miyata, Marcelo Seido Nagano, Jatinder N. D. Gupta

Summary: This article incorporates maintenance operations into the blocking flow shop to minimize total completion time and maintenance costs. It develops a mixed integer linear programming and procedures for job sequence with maintenance. The study adapts different algorithms to solve small, medium, and large sets of instances, and evaluates their performance based on trade-off between solution quality and computational time.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2023)

Article Green & Sustainable Science & Technology

Sustainable microgrid design with peer-to-peer energy trading involving government subsidies and uncertainties

Vincent F. Yu, Thi Huynh Anh Le, Jatinder N. D. Gupta

Summary: Sustainable microgrid is a feasible approach to handle environmental impacts and satisfy customer demand. However, the installation rate has been limited due to high initial investment cost. This paper investigates the effect of government subsidies, peer-to-peer energy trading, financial factors, and demand elasticity coefficient on sustainable microgrid design.

RENEWABLE ENERGY (2023)

Article Automation & Control Systems

Robust scheduling of EMU first-level maintenance in a stub-end depot under stochastic uncertainties

Ming He, Qiuhua Tang, Jatinder N. D. Gupta, Zikai Zhang, Jun Cao

Summary: This study proposes a robust scheduling model for first-level maintenance of electric multiple units in railway systems. An adaptive iterative local search algorithm is developed to solve this model. The proposed model considers flexible maintenance routes, train shunting conflicts, and track occupation conflicts, and includes uncertain parameters in objective functions and constraints. The algorithm incorporates problem-specific neighborhood structures, a variable neighborhood descent method, and an adaptive perturbation mechanism to achieve a trade-off between robustness and efficiency.

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2023)

Article Computer Science, Interdisciplinary Applications

Environmental cold chain distribution center location model in the semiconductor supply chain: A hybrid arithmetic whale optimization algorithm

Xiaolin Wang, Liyi Zhan, Yong Zhang, Teng Fei, Ming-Lang Tseng

Summary: This study proposes an environmental cold chain logistics distribution center location model to reduce transportation costs and carbon emissions. It also introduces a hybrid arithmetic whale optimization algorithm to overcome the limitations of the conventional algorithm.

COMPUTERS & INDUSTRIAL ENGINEERING (2024)

Article Computer Science, Interdisciplinary Applications

Blockchain-enabled integrated model for production-inventory-delivery problem in Physical Internet

Hong-yu Liu, Shou-feng Ji, Yuan-yuan Ji

Summary: This study proposes an architecture that utilizes Ethereum to investigate the production-inventory-delivery problem in Physical Internet (PI), and develops an iterative heuristic algorithm that outperforms other algorithms. However, due to gas prices and consumption, blockchain technology may not always be the optimal solution.

COMPUTERS & INDUSTRIAL ENGINEERING (2024)

Article Computer Science, Interdisciplinary Applications

The fuzzy human-robot collaboration assembly line balancing problem

Paraskevi Th. Zacharia, Elias K. Xidias, Andreas C. Nearchou

Summary: This article discusses the assembly line balancing problem in production lines with collaborative robots. Collaborative robots have the potential to improve automation, productivity, accuracy, and flexibility in manufacturing. The article explores the use of a problem-specific metaheuristic to solve this complex problem under uncertainty.

COMPUTERS & INDUSTRIAL ENGINEERING (2024)