Two-machine flowshop scheduling problem with coupled-operations

Meziani, Nadjat; Oulamara, Ammar; Boudhar, Mourad

doi:10.1007/s10479-018-2967-z

“…The performance of the proposed algorithms evaluated on a series of problem instances confirms the superiority of the hybridized algorithm. Meziani et al (2019) extended their previous study and examined the complexity status of several cases. For example, they proved the N P -hardness of the cases (aj, p, p, cj) and (p, p, bj, cj).…”

Section: Other Variants Of the Flow Shop Coupled Task Scheduling Problemmentioning

confidence: 97%

Coupled task scheduling with exact delays: Literature review and models

Khatami

¹

,

Salehipour

²

,

Cheng

³

2020

European Journal of Operational Research

View full text Add to dashboard Cite

The coupled task scheduling problem concerns scheduling a set of jobs, each with at least two tasks and there is an exact delay period between two consecutive tasks, on a set of machines to optimize a performance criterion. While research on the problem dates back to the 1980s, interests in the computational complexity of variants of the problem and solution methodologies have been evolving in the past few years. This motivates us to present an up-to-date and comprehensive literature review on the topic. Aiming to provide a complete road map for future research on the coupled task scheduling problem, we discuss all the relevant studies and potential research opportunities. In addition, we propose several sets of benchmark instances for the problem in various settings and provide a detailed evaluation of all the available models with a view to facilitating future research on the solution methods.

show abstract

“…The performance of the proposed algorithms evaluated on a series of problem instances confirms the superiority of the hybridized algorithm. Meziani et al (2018b) extended their previous study and examined the complexity status of several cases. For example, they proved the NP-hardness of the cases (aj, p, p, cj) and (p, p, bj, cj).…”

Section: Other Variants Of the Flow Shop Coupled Task Scheduling Problemmentioning

confidence: 97%

Coupled Task Scheduling With Exact Delays: Literature Review and Models

Khatami

¹

,

Salehipour

²

,

Cheng

³

2018

View full text Add to dashboard Cite

The coupled task scheduling problem concerns scheduling a set of jobs, each with at least two tasks and there is an exact delay period between two consecutive tasks, on a set of machines to optimize a performance criterion. While research on the problem dates back to the 1980s, interests in the computational complexity of variants of the problem and solution methodologies have been evolving in the past few years. This motivates us to present an up-to-date and comprehensive literature review on the topic. Aiming to provide a complete road map for future research on the coupled task scheduling problem, we discuss all the relevant studies and potential research opportunities. In addition, we propose several sets of benchmark instances for the problem in various settings and provide a detailed evaluation of all the available models with a view to facilitating future research on the solution methods.

show abstract

“…In this section, we propose several heuristics to solve the problem Meziani et al (2014) have proved that this problem is NP-hard. These heuristics are based on the uses of priority rules (LP T and SP T ), which are applied to the processing time (a j , b j , c j ) or to the time lags (L j ).…”

Section: Heuristicsmentioning

confidence: 99%

“…As our knowledge, the flowshop problem on two machines with coupled-operations on the first machine and one operation on the second machine has not been tackled in the literature. Meziani et al (2014) are the first to prove that the problems…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

PSO and simulated annealing for the two-machine flowshop scheduling problem with coupled-operations

Meziani

¹

,

Boudhar

²

,

Oulamara

³

2018

EJIE

Self Cite

View full text Add to dashboard Cite

In this paper, we proposed an hybrid algorithm combining particle swarm optimisation with the simulated annealing (PSO-SA) to solve the flowshop problem with coupled-operations in the presence of the time lags. The criterion to minimise is the makespan. To verify the performance of the hybridised algorithm, computational experiments are performed and the obtained results are compared with the simulated annealing and PSO algorithms. However, the experimental results show that the PSO-SA performs better than the others approaches. [

show abstract

Two-machine flowshop scheduling problem with coupled-operations

Cited by 4 publications

References 16 publications

Coupled task scheduling with exact delays: Literature review and models

Coupled task scheduling with exact delays: Literature review and models

Coupled Task Scheduling With Exact Delays: Literature Review and Models

PSO and simulated annealing for the two-machine flowshop scheduling problem with coupled-operations

Contact Info

Product

Resources

About