The following pages link to Jen-Ya Wang (Q336670):
Displaying 11 items.
- Minimizing resource consumption on uniform parallel machines with a bound on makespan (Q336672) (← links)
- A scheduling problem with three competing agents (Q337134) (← links)
- Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments (Q712676) (← links)
- A near-optimal database allocation for reducing the average waiting time in the grid computing environment (Q730954) (← links)
- A linearly convergent method for broadcast data allocation (Q1004673) (← links)
- A lower bound for minimizing the total completion time of a three-agent scheduling problem (Q1671716) (← links)
- Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects (Q1751144) (← links)
- A three-agent scheduling problem for minimizing the flow time on two machines (Q5109775) (← links)
- Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit (Q5223044) (← links)
- A makespan minimization problem for versatile developers in the game industry (Q6186551) (← links)
- A job scheduling and rejection problem considering self-contained and cross-functional jobs (Q6658908) (← links)
