Incorporating preventive maintenance into the <i>m</i>-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study

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

doi:10.1080/0305215x.2018.1485903

Cited by 22 publications

(6 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Maintenance is scheduled according to the conservative criterion as mentioned in Section 4.1.4 . Jabbarizadeh et al (2009) , Naderi et al (2009b) , Naderi et al (2011) and Miyata et al (2019b) extend the work of and adopt similar policies and approaches in their work. Wang & Liu (2014) , Khatami & Zegordi (2017) and Seidgar et al (2016) adopt the maintenance scheduling policy proposed by Berrichi et al (2009) , where instead of maximizing the machine availability, the whole system availability is considered.…”

Section: Scheduling With a Pm Policymentioning

confidence: 94%

“…In the work of ) , Jabbarizadeh, Zandieh, & Talebi (2009 , Naderi, Zandieh, & Fatemi Ghomi (2009b) , Naderi, Zandieh, & Aminnayeri (2011) , Miyata, Nagano, & Gupta (2019b , Wang & Liu (2014) , Khatami & Zegordi (2017) and Seidgar, Zandieh, & Mahdavi (2016) , maintenance is scheduled according to a policy. The study by is the first to introduce the scheduling problem where the interval of the maintenance activities is determined preparatory to scheduling the jobs.…”

Section: Scheduling With a Pm Policymentioning

confidence: 99%

“…In this strategy, first a job schedule is generated during each iteration and then maintenance is inserted according to the rational strategy proposed by Berrichi et al (2009) . All studies present metaheuristic solutions, except for Miyata et al (2019b) , which presents multiple constructive heuristics. Khatami & Zegordi (2017) propose a mathematical model for their problem.…”

Section: Scheduling With a Pm Policymentioning

confidence: 99%

See 2 more Smart Citations

Production, maintenance and resource scheduling: A review

Geurtsen

Didden

Adan

et al. 2023

European Journal of Operational Research

View full text Add to dashboard Cite

Section: Scheduling With a Pm Policymentioning

confidence: 94%

Section: Scheduling With a Pm Policymentioning

confidence: 99%

Section: Scheduling With a Pm Policymentioning

confidence: 99%

See 1 more Smart Citation

Production, maintenance and resource scheduling: A review

Geurtsen

Didden

Adan

et al. 2023

European Journal of Operational Research

View full text Add to dashboard Cite

“…Chansombat et al (2019) proposed a mixed-integer linear programming model for integrated production and preventive maintenance scheduling in the capital goods industry. Miyata et al (2019a) incorporated preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization. Miyata et al (2019b) incorporated preventive maintenance operations as a constraint to the m-machine no-wait flow shop problem with dependent-sequence setup times and makespan minimization scheduling problem.…”

Section: Literature Reviewmentioning

confidence: 99%

Proposed Procedure for Optimal Maintenance Scheduling Under Emergent Failures

Al–Refaie

Al-Shalaldeh

Lepkova

2020

Journal of Civil Engineering and Management

View full text Add to dashboard Cite

Production lines are usually subjected to emergent machine failures. Such emergent failures disrupt pre-established maintenance schedules, which challenge maintenance engineers to react to those failures in real time. This research proposes an optimization procedure for optimizing scheduling repairs of emergent failures. Three optimization models are developed. Model I schedules failures in newly idle repair shops with the objective of maximizing the number of scheduled repairs. Model II maximizes the number of assigned repairs to untapped ranges. Model III maximizes both the number of assigned failure repairs and satisfaction on regular and emergency repairs by resequencing regular and emergent failures in the shop that contains the largest free margin. A real case study is provided to illustrate the proposed optimization procedure. Results reveal that the proposed models efficiently scheduled and sequenced emergent failures in the idle maintenance shops, the untapped ranges between repairs of regular failures, and in the maintenance shop with the largest free margin. In conclusions, the proposed models can greatly support maintenance engineers in planning repairs under unexpected failures.

show abstract

“…However, the new modeling technique and an enumeration algorithm are proposed to address the NWFSSP with the makespan criterion and due date constraints, which can shrink the feasible region and enhance the search speed. 5 The heuristics and constructive 1 School of Mechanical and Electrical Engineering, Henan Institute of Science and Technology, Xinxiang, China heuristics [6][7][8] are proposed to resolve the NWFSSP with makespan or total flow-time minimization criterion. In addition, to solve the NWFSSP with large size, a jigsaw puzzle-inspired algorithm is presented.…”

Section: Introductionmentioning

confidence: 99%

A discrete whale optimization algorithm for the no-wait flow shop scheduling problem

Zhang

2023

Measurement and Control

View full text Add to dashboard Cite

A discrete whale optimization algorithm (DWOA) is presented to solve the no-wait flow shop scheduling problem (NWFSSP) with the optimization objective makespan. An effective combination of nearest neighbor (NN) and standard deviation heuristics (SDH) is used to acquire initial solutions of the population. After that, three crossover operators, the two-point crossover (TPX), multiple-point crossover (MPX) and job-based crossover (JBX) operators, are designed to mimics the humpback whales hunting process. Moreover, the dynamic transform mechanism of search process is designed to better balance the exploration and exploitation ability of DWOA. In order to further improve the optimization effect of DWOA, the parallel neighborhood search (PNS) and the serial neighborhood search (SNS) are selected to execute the local search and promoting global search scheme, respectively. Finally, to test the performance of DWOA, extensive experiments are conducted on benchmarks designed by Reeves and Taillard, which contain parameters tuning, effectiveness of the improvement strategies in the DWOA and comparison with several existing algorithms. From the experimental results, it is validated that the effectiveness of the improved mechanisms and the performance of the DWOA which can find better makespan values compared with other algorithms for solving NWFSSP.

show abstract

Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study

Cited by 22 publications

References 46 publications

Production, maintenance and resource scheduling: A review

Production, maintenance and resource scheduling: A review

Proposed Procedure for Optimal Maintenance Scheduling Under Emergent Failures

A discrete whale optimization algorithm for the no-wait flow shop scheduling problem

Contact Info

Product

Resources

About