The following pages link to Bart Veltman (Q2018937):
Displayed 13 items.
- Item:Q2018937 (redirect page) (← links)
- Multiprocessor scheduling with communication delays (Q922681) (← links)
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard (Q1266667) (← links)
- Three, four, five, six, or the complexity of scheduling with communication delays (Q1342284) (← links)
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations (Q1343144) (← links)
- Shift rostering using decomposition: assign weekend shifts first (Q2018938) (← links)
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem (Q2470097) (← links)
- Equilibrium in queueing systems with complementary products (Q2572904) (← links)
- Cooperation in one machine scheduling (Q3142152) (← links)
- Sequencing and Cooperation (Q4305760) (← links)
- The Complexity of Scheduling Trees with Communication Delays (Q4864438) (← links)
- (Q5286651) (← links)
- TRUTH-TELLING EQUILIBRIA FOR BAYESIAN GAMES ARISING FROM SEQUENCING SITUATIONS (Q5476228) (← links)