The following pages link to Joel M. Wein (Q1577467):
Displayed 27 items.
- (Q1183463) (redirect page) (← links)
- Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems (Q1183464) (← links)
- Approximating the minimum-cost maximum flow is P-complete (Q1198087) (← links)
- Minimizing average completion time in the presence of release dates (Q1290642) (← links)
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117) (← links)
- Improved bounds on relaxations of a parallel machine scheduling problem (Q1383802) (← links)
- A 1. 47-approximation for a preemptive single-machine scheduling problem (Q1577468) (← links)
- Off-line admission control for general scheduling problems (Q1592760) (← links)
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) (← links)
- An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems (Q2890462) (← links)
- (Q3138949) (← links)
- (Q3840374) (← links)
- (Q4010317) (← links)
- (Q4250213) (← links)
- Improved Approximation Algorithms for Shop Scheduling Problems (Q4302287) (← links)
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms (Q4361782) (← links)
- Task Scheduling in Networks (Q4377449) (← links)
- (Q4526977) (← links)
- (Q4818873) (← links)
- Techniques for scheduling with rejection (Q4820909) (← links)
- Scheduling Parallel Machines On-Line (Q4862799) (← links)
- (Q4875178) (← links)
- (Q4952713) (← links)
- Task scheduling in networks (Q5054769) (← links)
- Scheduling jobs that arrive over time (Q5057424) (← links)
- Integer Programming and Combinatorial Optimization (Q5712478) (← links)
- Optimal time-critical scheduling via resource augmentation (Q5957573) (← links)