Minimizing tardiness and maintenance costs in flow shop scheduling by a lower-bound-based GA

Yu, Andrew Junfang; Seif, Javad

doi:10.1016/j.cie.2016.03.024

Cited by 64 publications

(29 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(2016) introduced a constructive heuristic based on the one proposed by Laha and Sarin (2009). Yu and Seif (2016) proposed a lower bound based on a GA to minimize the total tardiness and maintenance cost. Rossi et al.…”

Section: Related Workmentioning

confidence: 99%

A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs

VILLARINHO

Panadero

Pessôa

et al. 2020

Int Trans Operational Res

View full text Add to dashboard Cite

This paper analyzes the permutation flow-shop problem with delivery dates and cumulative payoffs (whenever these dates are met) under uncertainty conditions. In particular, the paper considers the realistic situation in which processing times are stochastic. The main goal is to find the permutation of jobs that maximizes the expected payoff. In order to achieve this goal, the paper first proposes a biased-randomized heuristic for the deterministic version of the problem. Then, this heuristic is extended into a metaheuristic by encapsulating it into a variable neighborhood descent framework. Finally, the metaheuristic is extended into a simheuristic by incorporating Monte Carlo simulations. According to the computational experiments, the level of uncertainty has a direct impact on the solutions provided by the simheuristic. Moreover, a risk analysis is performed using two well-known metrics: the value-at-risk and conditional value-at-risk.

show abstract

Section: Related Workmentioning

confidence: 99%

A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs

VILLARINHO

Panadero

Pessôa

et al. 2020

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…Specifically, in Fig. 2, if workstation 1 is to be maintained, tasks (1,2,4) are reallocated into workstations 2 and tasks (8,10) into workstation 3. After maintenance, all these tasks return immediately and the production mode under PM scenario 2 is changed back to the regular operation scenario.…”

Section: B Assignment Plans and Task Alterationsmentioning

confidence: 99%

“…In contrast, existing literature has demonstrated that integrating PM into the production scheduling within flexible flow shops can reduce the running cost and system unavailability time. Specifically, Yu and Seif [10] demonstrated the integration of them can shorten the total maintenance and tardiness costs. Feng et al [11] addressed a sequence-dependent group scheduling problem within a flexible flow shop and they claimed that implementing PM at the idle time between groups can shorten the production cycle time and save the manufacturing cost.…”

Section: Introductionmentioning

confidence: 99%

An Improved Lexicographical Whale Optimization Algorithm for the Type-II Assembly Line Balancing Problem Considering Preventive Maintenance Scenarios

et al. 2020

View full text Add to dashboard Cite

In the traditional assembly line balancing, all the workstations are assumed available and hence the unavailability of any workstation brings about the stoppage of the whole line and the waste of the production capacity in the rest workstations. Considering the planning characteristic of preventive maintenance, this paper proposes a novel methodology of integrating the preventive maintenance scenarios into assembly line balancing problems to bypass the unavailable workstation. A lexicographic model is formulated to generate multiple task assignment plans that ensure primarily the high productivity under regular operation scenario and guarantee secondarily the production continuity under preventive maintenance scenarios. And, an improved whale optimization algorithm (IWOA) with three modifications is proposed to solve this problem. Specifically, a combined crossover operator enhances better combination in exploration; three best search agents promote the exploitation; partial regeneration avoids being trapped in local optima. More than five thousand experiments demonstrate that the joint of three modifications endows the IWOA significant superiority over six variants and other six well-known algorithms. Moreover, integrating preventive maintenance scenarios into the assembly line balancing problem increases the production efficiency by 1% at the cost of small production adjustment.

show abstract

“…In general, such a scheduling problem with maintenance is NP-hard [55,57,59]. Even if only one single machine needs to be maintained within a maintenance window, the problem is still NP-hard.…”

Section: Problem Formulationmentioning

confidence: 99%

A three-agent scheduling problem for minimizing the flow time on two machines

Lee

Wang

2020

RAIRO-Oper. Res.

View full text Add to dashboard Cite

This study introduces a two-machine three-agent scheduling problem. We aim to minimize the total tardiness of jobs from agent 1 subject to that the maximum completion time of jobs from agent 2 cannot exceed a given limit and that two maintenance activities from agent 3 must be conducted within two maintenance windows. Due to the NP-hardness of this problem, a genetic algorithm (named GA+) is proposed to obtain approximate solutions. On the other hand, a branch-and-bound algorithm (named B&B) is developed to generate the optimal solutions. When the problem size is small, we use B&B to verify the solution quality of GA+. When the number of jobs is large, a relative deviation is proposed to show the gap between GA+ and another ordinary genetic algorithm. Experimental results show that the proposed genetic algorithm can generate approximate solutions by consuming reasonable execution time.

show abstract

Minimizing tardiness and maintenance costs in flow shop scheduling by a lower-bound-based GA

Cited by 64 publications

References 43 publications

A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs

A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs

An Improved Lexicographical Whale Optimization Algorithm for the Type-II Assembly Line Balancing Problem Considering Preventive Maintenance Scenarios

A three-agent scheduling problem for minimizing the flow time on two machines

Contact Info

Product

Resources

About