6 papers
Minimizing the makespan in job shop scheduling under conflict graph constraints
Nour Elhouda Tellache, Abdenour Azerine
We study the job shop scheduling problem with a conflict graph (JSC), in which adjacent jobs in the conflict graph cannot be processed simultaneously on different machines, with th…
A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
Elise Bangerter, David Schindl, Meritxell Pacheco Paneque +2
Electric utility companies perform numerous technical interventions every day. Since it is generally not possible to complete all planned interventions within a single day, compani…
Aircraft routing: periodicity and complexity
Frédéric Meunier, Axel Parmentier, Nour ElHouda Tellache
The aircraft routing problem is one of the most studied problems of operations research applied to aircraft management. It involves assigning flights to aircraft while ensuring reg…
Scheduling on identical machines with conflicts to minimize the mean flow time
Nour ElHouda Tellache, Lydia Aoudia, Mourad Boudhar
This paper addresses the problem of scheduling jobs on identical machines with conflict constraints, where certain jobs cannot be scheduled simultaneously on different machines. We…
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
Nour ElHouda Tellache, Roberto Baldacci
The Minimum Path Cover (MPC) problem consists of finding a minimum-cardinality set of node-disjoint paths that cover all nodes in a given graph. We explore a variant of the MPC pro…
Linear lexicographic optimization and preferential bidding system
Nour ElHouda Tellache, Frédéric Meunier, Axel Parmentier
Some airlines use the preferential bidding system to construct the schedules of their pilots. In this system, the pilots bid on the different activities and the schedules that lexi…