Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks

Simonin, Gilles; Giroudeau, Rodolphe; König, Jean-Claude

doi:10.1016/j.endm.2010.05.082

Cited by 8 publications

(3 citation statements)

References 7 publications

(8 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Approximation algorithm for problem Π ′ 1 This section will be about the approximation study focalized on the N P-complete problem Π ′ 1 : 1|a i = b i = p, L i = L, G c |C max . The problem Π ′ 2 has been studied in two respective papers (Simonin, Giroudeau, and König July 2010;.…”

Section: Summary Of Complexity Resultsmentioning

confidence: 99%

Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph

Simonin

Giroudeau

König

et al. 2011

ICAPS

View full text Add to dashboard Cite

This paper presents a generalization of the coupled-task scheduling problem introduced by Shapiro, where considered tasks are subject to incompatibility constraint depicted by an undirected graph. The motivation of this problem comes from data acquisition and processing in a mono-processor torpedo used for underwater exploration. As we add the compatibility graph, we focus on complexity of the problem, and more precisely on the border between P and NP-completeness when some other input parameters are restricted (e.g. the ratio between the durations of the two sub-tasks composing a task): we adapt the global visualization of the complexity of scheduling problems with coupled-task given by Orman and Potts to our problem, determine new complexity results, and thus propose a new visualization including incompatibility constraint. In the end, we give a new polynomial-time approximation algorithm result which completes previous works.

show abstract

Section: Summary Of Complexity Resultsmentioning

confidence: 99%

Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph

Simonin

Giroudeau

König

et al. 2011

ICAPS

View full text Add to dashboard Cite

show abstract

“…Yu et al (2004) proved that the problem on two machines F 2/Coup − T ask, a j = b j = 1, L j /C max is NP-hard. Simonin et al (2010) studied the coupled-tasks problem in the presence of the treatment tasks. 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.…”

Section: Introductionmentioning

confidence: 99%

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

Meziani

Boudhar

Oulamara

2018

EJIE

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

“…And he proposed a simulation model and a simulation algorithm for estimating the duration of ordering iterative tasks. G. Simonin and others [5] consider the ordering problems in coupled tasks in the treatment process of the tasks and propose an polynomial time algorithm, the time complexity of which is O(nlog(n)). W. M. Zhang [6] proposes an ordering iterative process model of conditional activities and establishes three models for duration estimation of the ordering iterative process of conditional activities.…”

Section: Introductionmentioning

confidence: 99%

Research on Duration Prediction of the Coupled Task Set Based on the Grey System Theory

Jia

Gao

et al. 2012

AMM

View full text Add to dashboard Cite

In order to solve the problem of duration predicting in the project with poor information, small sample and uncertainty, a method based on grey system theory is put forward to predicting the duration of the coupled task set. A grey duration prediction model GM(1,1) is built, and the accuracy of the model is tested through residual, degree of incidence and posterior variance. Finally, the feasibility of the prediction model is verified by a practical application case.

show abstract

Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks

Abstract: We consider the problem to schedule n coupled-tasks in presence of treatment tasks. This work is motivated by the problem of data acquisition for a torpedo. In such context, we developp a O(nlog(n)) polynomial-time algorithm for a specific coupledtasks scheduling problem.

Cited by 8 publications

References 7 publications

Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph

Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph

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

Research on Duration Prediction of the Coupled Task Set Based on the Grey System Theory

Contact Info

Product

Resources

About