Sciweavers

16 search results - page 4 / 4
» Majority constraints have bounded pathwidth duality
Sort
View
JAIR
2007
111views more  JAIR 2007»
13 years 4 months ago
Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
J. Christopher Beck, Nic Wilson