The following pages link to Soo Y. Chang (Q453605):
Displaying 18 items.
- Automated knowledge source selection and service composition (Q453606) (← links)
- The steepest descent gravitational method for linear programming (Q583105) (← links)
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- Online and semi-online scheduling of two machines under a grade of service provision (Q867934) (← links)
- Heuristics for automated knowledge source integration and service composition (Q941554) (← links)
- Approximation of the \(k\)-batch consolidation problem (Q1006079) (← links)
- The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines (Q1304470) (← links)
- Order consolidation for batch processing (Q1774533) (← links)
- The effect of machine availability on the worst-case performance of LPT (Q1775060) (← links)
- On \({\mathbb{K}}^{\Delta}\) (Q1821691) (← links)
- A heuristic method for self-healing ring design in a single-homing cluster (Q1854855) (← links)
- Parallel machine scheduling under a grade of service provision (Q1879792) (← links)
- Order consolidation for hierarchical product lines (Q2015800) (← links)
- A two-dimensional vector packing model for the efficient use of coil cassettes (Q2387252) (← links)
- Approximation of a batch consolidation problem (Q3113503) (← links)
- (Q4247061) (← links)
- (Q4546243) (← links)
- A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS (Q4650621) (← links)
