Retour au site du LAAS-CNRS

Laboratoire d’analyse et d’architecture des systèmes
Choisir la langue : FR | EN

869documents trouvés

17402
06/11/2017

Cyclic job shop problem with varying processing times

I.HAMAZ, L.HOUSSIN, S.CAFIERI

ROC, ENAC

Revue Scientifique : IFAC-PapersOnLine, Vol.20, N°1, pp.5012-5016, Novembre 2017 , N° 17402

Lien : https://hal-enac.archives-ouvertes.fr/hal-01626534

Diffusable

Plus d'informations

Abstract

In this paper, we consider a cyclic job shop problem where a subset of tasks have varying processing times. The minimum processing times and maximum processing times of these tasks are known. We propose a branch and bound method that finds the schedule which minimizes the mean cycle time with respect to variations. We show that the evaluation of a schedule can be considered as a volume calculus of some polytopes. Indeed, for each schedule we can associate a set of polytopes whose volumes provide information on the variation effect on the considered schedule.

141393
17395
31/10/2017

Minimum-fuel fixed time impulsive elliptic glideslope guidance algoriths using semidefinite programming

Y.ARIBA, D.ARZELIER

MAC, ROC

Rapport LAAS N°17395, Octobre 2017, 32p.

Diffusable

141372
16227
25/10/2017

Integrated production and outbound distribution scheduling problems with job release dates and deadlines

LFU, M.A.ALOULOU, C.ARTIGUES

LAMSADE, ROC

Revue Scientifique : Journal of Scheduling, 31p., Octobre 2017, DOI 10.1007/s10951-017-0542-0 , N° 16227

Lien : https://hal.archives-ouvertes.fr/hal-01351929

Diffusable

Plus d'informations

Abstract

In this paper, we study an integrated production and outbound distribution scheduling model with one manufacturer and one customer. The manufacturer has to process a set of jobs on a single machine and deliver them in batches to the customer. Each job has a release date and a delivery deadline. The objective of the problem is to issue a feasible integrated production and distribution schedule minimizing the transportation cost subject to the delivery deadline constraints. We consider three problems with different ways how a job can be produced and delivered: non-splittable production and delivery (NSP-NSD) problem, splittable production and non-splittable delivery (SP-NSD) problem and splittable production and delivery (SP-SD) problem. We provide a polynomial-time algorithm that solves two special cases of SP-NSD and SP-SD problems. Solving these problems allows us to compute a lower bound for the NP-hard problem NSP-NSD, which we use in a branch and bound (B&B) algorithm to solve problem NSP-NSD. The computational results show that the B&B algorithm outperforms a MILP formulation of the problem implemented on a commercial solver. keywords: single machine scheduling production and delivery release dates deadlines transportation costs branch and bound.

141354
17394
25/10/2017

Column generation for outbound baggage handling at airports

M.FREY, R.KOLISCH, C.ARTIGUES

Munchen, ROC

Revue Scientifique : Transportation Science, 35p., Octobre 2017, https://doi.org/10.1287/trsc.2017.0739 , N° 17394

Lien : https://hal.archives-ouvertes.fr/hal-01614391

Diffusable

Plus d'informations

Abstract

The planning of outbound baggage handling at international airports is challenging. Outgoing flights have to be assigned and scheduled to handling facilities at which the outgoing baggage is loaded into containers. To avoid disruptions of the system the objective is to minimize workload peaks over the entire system. The resource demand of the jobs, which have to be scheduled, is depending on the arrival process of the baggage. In this paper we present a time-indexed mathematical programming formulation for planning the outbound baggage. We propose an innovative decomposition procedure in combination with a column generation scheme to solve practical problem instances. The decomposition significantly reduces the symmetry effect in the time-indexed formulation and also speeds up the computational time of the corresponding Dantzig-Wolfe formulation. To further improve our column generation algorithm we propose state-of-the-art acceleration techniques for the primal problem and pricing problem. Computational results based on real data from a major European Airport show that the proposed procedure reduces the maximal workloads by more than 60% in comparison to the current assignment procedure used.

141353
17110
24/10/2017

A minimum-fuel fixed-time low-thrust rendezvous solved with the switching systems theory

C.GAZZINO, D.ARZELIER, L.CERRI, D.LOSA, C.LOUEMBET, C.PITTET-MECHIN

MAC, ROC, CNES, Thalès Alenia Space

Revue Scientifique : Transactions of the Japan Society for Aeronautical and Space Sciences, 8p., Octobre 2017, To appear , N° 17110

Lien : https://hal.laas.fr/hal-01609252

Diffusable

Plus d'informations

Abstract

In this paper, a fuel optimal rendezvous problem is tackled in the Hill-Clohessy-Wiltshire framework with several operational constraints as bounds on the thrust, non linear non convex and disjunctive operational constraints (on-off profile of the thrusters, minimum elapsed time between two consecutive firings...). An indirect method and a decomposition technique have already been combined in order to solve this kind of optimal control problem with such constraints. Due to a great number of parameters to tune, satisfactory results are hard to obtain and are sensitive to the initial condition. Assuming that no singular arc exists, it can be shown that the optimal control exhibits a bang-bang structure whose optimal switching times are to be found. Noticing that a system with a bang-bang control profile can be considered as two subsystems switching from one with control on to with control off, and vice-versa, a technique coming from the switching systems theory is used in order to optimise the switching times.

141336
16125
24/10/2017

Root cause analysis of actuator fault based on invertibility of interconnected system

M.ZHANG, Z.LI, M.CABASSUD, B.DAHHOU

LGC, GUIZHOU, DISCO

Revue Scientifique : International Journal of Modelling, Identification and Control, Vol.27, N°4, pp.256-270, Octobre 2017 , N° 16125

Diffusable

Plus d'informations

Abstract

This paper addresses the problem of root cause analysis (RCA) of actuator fault. By considering an actuator as an individual dynamic subsystem connected with process dynamic subsystem in cascade, an interconnected system is then constituted. The fault detection and diagnosis (FDD) algorithm is carried out in actuator subsystem and aims at identifying the root causes of actuator faults. According to real plant, outputs of the actuator subsystem are assumed inaccessible and are reconstructed by measurements of the global system, thus providing a means of monitoring and diagnosis of the plant at both local and global level. A condition of invertibility of the interconnected system is first developed to guarantee that faults occurring in the actuator subsystem will affect the measured output of the global system distinguishably. For that, a necessary and sufficient condition is proposed to ensure invertibility of the interconnected system. Effectiveness of the proposed approach is demonstrated on an intensified HEX reactor.

141340
17393
24/10/2017

A minimum-fuel fixed-time low-thrust rendezvous solved with the switching systems theory

C.GAZZINO, D.ARZELIER, L.CERRI, D.LOSA, C.LOUEMBET, C.PITTET-MECHIN

MAC, ROC, CNES, Thalès Alenia Space

Rapport LAAS N°17393, Octobre 2017, 8p.

Diffusable

141334
17389
23/10/2017

Practical stabilisation of switched affine systems with dwell-time guarantees

C.ALBEA SANCHEZ, G.GARCIA, S.HADJERAS, W.P.M.H.HEEMELS, L.ZACCARIAN

MAC, Eindhoven

Rapport LAAS N°17389, Octobre 2017, 8p.

Lien : https://hal.archives-ouvertes.fr/hal-01617999

Diffusable

Plus d'informations

Abstract

The paper deals with the problem of practical stabilisation of operating points for switched affine systems, ensuring a dwell-time associated with an LQR performance level during the transient response and an admissible chattering around the operating point. In this paper we propose a solution to this problem in which the formal guarantees are established using recent tools from hybrid dynamical systems theory. We also include insights on the quadratic performance of the proposed switching strategies.

141325
17378
20/10/2017

Detailed proof of the Lemma 1 used in the manuscript " Discontinuous model recovery anti-windup solution for image based visual servoing " submitted to Automatica

L.BURLION, L.ZACCARIAN, H.DE PLINVAL, S.TARBOURIECH

ONERA, MAC

Rapport LAAS N°17378, Octobre 2017, 4p.

Lien : https://hal.inria.fr/hal-01593178

Diffusable

141292
17373
18/10/2017

Alarm management via temporal pattern learning

J.VASQUEZ, A.SUBIAS, L.TRAVE-MASSUYES, F.JIMENEZ

DISCO, Univ. de Los Andes

Revue Scientifique : Engineering Applications of Artificial Intelligence, Vol.65, pp.506-516, Octobre 2017 , N° 17373

Lien : https://hal.laas.fr/hal-01611635

Diffusable

Plus d'informations

Abstract

Industrial plant safety involves integrated management of all the factors that may cause accidents. Process alarm management can be formulated as a pattern recognition problem in which temporal patterns are used to characterize different typical situations, particularly at startup and shutdown stages. In this paper we propose a new approach of alarm management based on a diagnosis process. Assuming the alarms and the actions of the standard operating procedure as discrete events, the diagnosis step relies on situation recognition to provide the operators with relevant information on the failures inducing the alarm flows. The situation recognition is based on chronicle recognition where we propose to use the hybrid causal model of the system and simulations to generate the representative event sequences from which the chronicles are learned using the Heuristic Chronicle Discovery Algorithm Modified (HCDAM). An extension of this algorithm is presented in this article where the expertise knowledge is included as temporal restrictions which are a new input to HCDAM. An illustrative example in the field of petrochemical plants is presented.

141255
Les informations recueillies font l’objet d’un traitement informatique destiné à des statistiques d'utilisation du formulaire de recherche dans la base de données des publications scientifiques. Les destinataires des données sont : le service de documentation du LAAS.Conformément à la loi « informatique et libertés » du 6 janvier 1978 modifiée en 2004, vous bénéficiez d’un droit d’accès et de rectification aux informations qui vous concernent, que vous pouvez exercer en vous adressant à
Pour recevoir une copie des documents, contacter doc@laas.fr en mentionnant le n° de rapport LAAS et votre adresse postale. Signalez tout problème de dysfonctionnement à sysadmin@laas.fr. http://www.laas.fr/pulman/pulman-isens/web/app.php/