The following pages link to Odile Bellenguez-Morineau (Q336538):
Displaying 11 items.
- A constraint-based approach for the shift design personnel task scheduling problem with equity (Q336540) (← links)
- (Q398868) (redirect page) (← links)
- A note on the paper ``Minimizing total tardiness on parallel machines with preemptions'' (Q398870) (← links)
- Branch-and-price approach for the multi-skill project scheduling problem (Q479223) (← links)
- Methods to solve multi-skill project scheduling problem (Q926572) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints (Q2283293) (← links)
- A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time (Q2294894) (← links)
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria (Q2356094) (← links)
- A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines (Q2356122) (← links)
- A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem (Q3598682) (← links)
