The blocking flow shop scheduling problem: A comprehensive and conceptual review

Miyata, Hugo Hissashi; Nagano, Marcelo Seido

doi:10.1016/j.eswa.2019.06.069

Cited by 62 publications

(16 citation statements)

References 140 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The review studies on COPs in the existing literature either discussed both single and multi-objective versions of a specific COP or only its multi-objective version along with the solution approaches. Some of the reviewed single-objective COPs by the researchers focus on specific areas like blocking flowshop scheduling problem (FSP) [10], permutation FSP [11], non-permutation FSP [12], agricultural land-use allocation [13], facility location problems [14], emergency material scheduling [15], allocation of distributed generation [16], location-routing problems [17], resource allocation for CRAN in 5G and beyond networks [18], VRP [19], cell formation problem [20] and many more.…”

Section: Combinatorial Optimization Problems (Cops)-mentioning

confidence: 99%

A Comprehensive Review on NSGA-II for Multi-Objective Combinatorial Optimization Problems

2021

View full text Add to dashboard Cite

This paper provides an extensive review of the popular multi-objective optimization algorithm NSGA-II for selected combinatorial optimization problems viz. assignment problem, allocation problem, travelling salesman problem, vehicle routing problem, scheduling problem, and knapsack problem. It is identified that based on the manner in which NSGA-II has been implemented for solving the aforementioned group of problems, there can be three categories: Conventional NSGA-II, where the authors have implemented the basic version of NSGA-II, without making any changes in the operators; the second one is Modified NSGA-II, where the researchers have implemented NSGA-II after making some changes into it and finally, Hybrid NSGA-II variants, where the researchers have hybridized the conventional and modified NSGA-II with some other technique. The article analyses the modifications in NSGA-II and also discusses the various performance assessment techniques used by the researchers, i.e., test instances, performance metrics, statistical tests, case studies, benchmarking with other state-of-the-art algorithms. Additionally, the paper also provides a brief bibliometric analysis based on the work done in this study.

show abstract

Section: Combinatorial Optimization Problems (Cops)-mentioning

confidence: 99%

A Comprehensive Review on NSGA-II for Multi-Objective Combinatorial Optimization Problems

2021

View full text Add to dashboard Cite

show abstract

“…Therefore, using the notation proposed by Graham et al [11], both the Fm/prmu/ problems [1,10,13,20,22,23] as the Fm/block/ problems [4,8,16,18,21] are particular cases of the family Fm/ / /d i , when d i = 1 for all i ∈ I.…”

Section: Preliminariesmentioning

confidence: 99%

Exact and heuristic procedures for the Heijunka-flow shop scheduling problem with minimum makespan and job replicas

Valhondo

2021

Prog Artif Intell

View full text Add to dashboard Cite

In this paper, a new problem of job sequences in a workshop is presented, taking into account non-unit demands for the jobs and whose objective is to minimize the total completion time for all the jobs ($${C}_{max}$$ C max ) satisfying a set of restrictions imposed on the problem to preserve the production mix. Two procedures are proposed to solve the new problem: Mixed Integer Linear Programming and a Metaheuristic based on Multistart and Local Search. The two proposed procedures are tested using instance set Nissan-9Eng.I, in both cases giving rise to highly satisfactory performance both in quality of solutions obtained and in the CPU times required. Through a case study of the Nissan engine manufacturing plant in Barcelona, our economic-productive analysis reveals that it is possible to save an average of € 1162.83 per day, manufacturing 270 engines, when we transform the current assembly line into a Heijunka-Flow Shop.

show abstract

“…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. Miyata and Nagano (2019) fulfilled a deep literature review (in total 139 papers are reviewed and classified) on the m-machine flow shop scheduling problem with blocking conditions. Rossit et al (2019) studied the permutation flow shop and the non-permutation flow shop scheduling problems in the case of two jobs, when makespan is the objective function and processing times are not known.…”

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

The blocking flow shop scheduling problem: A comprehensive and conceptual review

Cited by 62 publications

References 140 publications

A Comprehensive Review on NSGA-II for Multi-Objective Combinatorial Optimization Problems

A Comprehensive Review on NSGA-II for Multi-Objective Combinatorial Optimization Problems

Exact and heuristic procedures for the Heijunka-flow shop scheduling problem with minimum makespan and job replicas

Proposed Procedure for Optimal Maintenance Scheduling Under Emergent Failures

Contact Info

Product

Resources

About