PERT scheduling with convex cost functionsCHRETIENNE, Philippe; SOURD, Francis.Theoretical computer science. 2003, Vol 292, Num 1, pp 145-164, issn 0304-3975, 20 p.Article

Conception et analyse d'algorithmes de liste en ordonnancement préemptif = Design and analysis of list algorithms for preemptive schedulingSanlaville, Eric; Chretienne, Philippe.1992, 201 p.Thesis

Problèmes d'ordonnancement avec délais de communication: complexité et algorithmes = Scheduling problems with communication delays: complexity and algorithmsColin, Jean-Yves; Chretienne, Philippe.1989, 170 p.Thesis

Ordonnancement dans les réseaux de processeurs : complexité et approximation = Scheduling in multiprocessors interconnection networks : complexity and approximationLahlou, Chams; Chretienne, Philippe.1998, 100 p.Thesis

ACRO : UN ATELIER DE CONCEPTION ET DE RÉALISATION DE LOGICIEL D'ORDONNANCEMENT INDUSTRIEL = INDUSTRIAL SCHEDULING : DESIGN OF SOFTWARE TOOLSGirard, Laurent; Chretienne, Philippe.2000, 211 p.Thesis

Contributions à l'étude et à la résolution de problèmes d'ordonnancement disjonctif = Study about solving disjunctive scheduling problemsSourd, Francis; Chretienne, Philippe.2000, 199 p.Thesis

Problèmes d'ordonnancement des architectures pipelines : modélisation, optimisation, algorithmesHanen, Claire; Chretienne, Philippe.1987, 236 p.Thesis

Complexity of minimizing the total flow time with interval data and minmax regret criterionLEBEDEV, Vasilii; AVERBAKH, Igor.Discrete applied mathematics. 2006, Vol 154, Num 15, pp 2167-2177, issn 0166-218X, 11 p.Conference Paper

Competitive algorithms for the bicriteria k-server problemFLAMMINI, Michele; NICOSIA, Gaia.Discrete applied mathematics. 2006, Vol 154, Num 15, pp 2117-2127, issn 0166-218X, 11 p.Conference Paper

A branch-and-bound algorithm to solve the linear ordering problem for weighted tournamentsCHARON, Irène; HUDRY, Olivier.Discrete applied mathematics. 2006, Vol 154, Num 15, pp 2097-2116, issn 0166-218X, 20 p.Conference Paper

A new trust region technique for the maximum weight clique problemBUSYGIN, Stanislav.Discrete applied mathematics. 2006, Vol 154, Num 15, pp 2080-2096, issn 0166-218X, 17 p.Conference Paper

SUR LA TRANSITION DE PHASE DE 3-SAT = ON THE 3-SAT PHASE TRANSITIONMandler, Jacques; Chrétienne, Philippe.2000, 113 p.Thesis

Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problemTHIONGANE, Babacar; NAGIH, Anass; PLATEAU, Gérard et al.Discrete applied mathematics. 2006, Vol 154, Num 15, pp 2200-2211, issn 0166-218X, 12 p.Conference Paper

Polyhedral results for the bipartite induced subgraph problemFOUILHOUX, Pierre; RIDHA MAHIOUB, A.Discrete applied mathematics. 2006, Vol 154, Num 15, pp 2128-2149, issn 0166-218X, 22 p.Conference Paper

Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequencesGAWIEJNOWICZ, Stanislaw; KURC, Wieslaw; PANKOWSKA, Lidia et al.Discrete applied mathematics. 2006, Vol 154, Num 15, pp 2150-2166, issn 0166-218X, 17 p.Conference Paper

Les problèmes d'ordonnancement = Scheduling problemsCarlier, Jacques; Chretienne, Philippe; Villon, Pierre et al.1993, 72 p.Report

A stabilized column generation scheme for the traveling salesman subtour problemWESTERLUND, Andreas; GÖTHE-LUNDGREN, Maud; LARSSON, Torbjörn et al.Discrete applied mathematics. 2006, Vol 154, Num 15, pp 2212-2238, issn 0166-218X, 27 p.Conference Paper

Minimizing the earliness and tardiness cost of a sequence of tasks on a single machineCHRETIENNE, Philippe.Operations research. 2001, Vol 35, Num 2, pp 165-187Conference Paper

Supply chain scheduling : Sequence coordinationAGNETIS, Alessandro; HALL, Nicholas G; PACCIARELLI, Dario et al.Discrete applied mathematics. 2006, Vol 154, Num 15, pp 2044-2063, issn 0166-218X, 20 p.Conference Paper