The following pages link to Joseph Y.-T. Leung (Q210310):
Displaying 50 items.
- Improved algorithms for single machine scheduling with release dates and rejections (Q262445) (← links)
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826) (← links)
- Multitasking via alternate and shared processing: algorithms and complexity (Q284835) (← links)
- Fast approximation algorithms for bi-criteria scheduling with machine assignment costs (Q296690) (← links)
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033) (← links)
- Integrated production and delivery on parallel batching machines (Q320081) (← links)
- An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes (Q336992) (← links)
- (Q408366) (redirect page) (← links)
- Coordination mechanisms with hybrid local policies (Q408369) (← links)
- Fast approximation algorithms for job scheduling with processing set restrictions (Q410716) (← links)
- Minimizing makespan in an ordered flow shop with machine-dependent processing times (Q411247) (← links)
- Berth allocation with time-dependent physical limitations on vessels (Q421704) (← links)
- Minimizing mean flowtime and makespan on master-slave systems (Q557659) (← links)
- Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- Open shops with jobs overlap -- revisited (Q706904) (← links)
- Minimizing the number of late jobs on unrelated machines (Q811339) (← links)
- A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions (Q834188) (← links)
- Online scheduling on two uniform machines subject to eligibility constraints (Q837188) (← links)
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness (Q856204) (← links)
- Order scheduling in an environment with dedicated resources in parallel (Q880508) (← links)
- Two machine scheduling under disruptions with transportation considerations (Q880527) (← links)
- Scheduling orders for multiple product types to minimize total weighted completion time (Q881573) (← links)
- Preemptive scheduling to minimize mean weighted flow time (Q910208) (← links)
- Minimizing mean flow time with release time constraint (Q914352) (← links)
- An asymptotic approximation scheme for the concave cost bin packing problem (Q933537) (← links)
- Online scheduling of equal-processing-time task systems (Q935146) (← links)
- Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time (Q940879) (← links)
- Scheduling problems in master-slave model (Q940888) (← links)
- Complexity of a scheduling problem with controllable processing times (Q969518) (← links)
- Integrated production and delivery scheduling with disjoint windows (Q972326) (← links)
- Scheduling two agents with controllable processing times (Q976351) (← links)
- A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs'' (Q987836) (← links)
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time (Q989525) (← links)
- A note on graph balancing problems with restrictions (Q990093) (← links)
- Flow shops with machine maintenance: ordered and proportionate cases (Q992582) (← links)
- Complexity of single machine scheduling subject to nonnegative inventory constraints (Q992655) (← links)
- Scheduling tree-structured tasks with restricted execution times (Q1111371) (← links)
- A new algorithm for scheduling periodic, real-time tasks (Q1115592) (← links)
- Bin packing: Maximizing the number of pieces packed (Q1133327) (← links)
- A note on preemptive scheduling of periodic, real-time tasks (Q1152707) (← links)
- Bounds on list scheduling of UET tasks with restricted resource constraints (Q1259426) (← links)
- On multidimensional packet routing for meshes with buses (Q1325974) (← links)
- (Q1606978) (redirect page) (← links)
- Tree precedence in scheduling: The strong-weak distinction (Q1606979) (← links)
- Integrated production and transportation on parallel batch machines to minimize total weighted delivery time (Q1628115) (← links)
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine (Q1694914) (← links)
- Integrated scheduling on a batch machine to minimize production, inventory and distribution costs (Q1698887) (← links)
- Integrated optimization of material supplying, manufacturing, and product distribution: models and fast algorithms (Q1735170) (← links)
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← links)
