The following pages link to Damien Prot (Q336539):
Displaying 9 items.
- A constraint-based approach for the shift design personnel task scheduling problem with equity (Q336540) (← links)
- (Q398867) (redirect page) (← links)
- A note on the paper ``Minimizing total tardiness on parallel machines with preemptions'' (Q398870) (← links)
- Using graph concepts to assess the feasibility of a sequenced air traffic flow with low conflict rate (Q992595) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← 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)
- Approximations for the two-machine cross-docking flow shop problem (Q2446855) (← links)
- A 4D-sequencing approach for air traffic management (Q2514871) (← links)
