Odile Bellenguez-Morineau

According to our database1, Odile Bellenguez-Morineau authored at least 21 papers between 2004 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


On csauthors.net:


A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time.
J. Sched., 2019

The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints.
J. Sched., 2019

A survey on how the structure of precedence constraints may change the complexity class of scheduling problems.
J. Sched., 2018

Performance evaluation of holonic control of a switch arrival system.
Concurr. Eng. Res. Appl., 2017

A case study of a hybrid flow shop with no-wait and limited idle time to minimize material waste.
Proceedings of the 15th IEEE International Symposium on Intelligent Systems and Informatics, 2017

A Novel Hybrid GA for the Assignment of Jobs to Machines in a Complex Hybrid Flow Shop Problem.
Proceedings of the Intelligent Systems Design and Applications, 2017

Scheduling a two-stage hybrid flow shop with dedicated machines, time lags and sequence-dependent family setup times.
Proceedings of the 2016 IEEE International Conference on Systems, Man, and Cybernetics, 2016

A note on NP-hardness of preemptive mean flow-time scheduling for parallel machines.
J. Sched., 2015

Complexity of a one-to-one meeting scheduling problem with two types of actors.
J. Oper. Res. Soc., 2015

Impact of precedence constraints on complexity of scheduling problems: a survey.
CoRR, 2015

Contribution à l'ordonnancement et la planication de ressources humaines.
, 2015

Branch-and-price approach for the multi-skill project scheduling problem.
Optim. Lett., 2014

A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner (2012).
J. Sched., 2013

New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria.
Eur. J. Oper. Res., 2013

A constraint-based approach for the shift design personnel task scheduling problem with equity.
Comput. Oper. Res., 2013

Tabu search and lower bound for an industrial complex shop scheduling problem.
Comput. Ind. Eng., 2012

Refining the boundary between P and NP for identical machine scheduling problems with preemption and release dates
CoRR, 2011

A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010]
CoRR, 2011

Methods to solve multi-skill project scheduling problem.
4OR, 2008

A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem.
RAIRO Oper. Res., 2007

Lower Bounds for the Multi-skill Project Scheduling Problem with Hierarchical Levels of Skills.
Proceedings of the Practice and Theory of Automated Timetabling V, 2004