The following pages link to Kangbok Lee (Q262444):
Displaying 41 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)
- Fast approximation algorithms for bi-criteria scheduling with machine assignment costs (Q296690) (← links)
- A heuristic for emergency operations scheduling with lead times and tardiness penalties (Q322544) (← links)
- Separation algorithm for tree partitioning inequalities (Q325404) (← links)
- Semi-online scheduling problems on a small number of machines (Q398877) (← links)
- Coordination mechanisms with hybrid local policies (Q408369) (← links)
- Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- Online scheduling on two uniform machines subject to eligibility constraints (Q837188) (← links)
- Online and semi-online scheduling of two machines under a grade of service provision (Q867934) (← 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)
- An extended formulation of the convex recoloring problem on a tree (Q1675254) (← links)
- The effect of machine availability on the worst-case performance of LPT (Q1775060) (← links)
- Two dimensional load balancing (Q1785303) (← links)
- Parallel machine scheduling under a grade of service provision (Q1879792) (← links)
- Coordination mechanisms for parallel machine scheduling (Q1926738) (← links)
- Two-stage proportionate flexible flow shop to minimize the makespan (Q1945694) (← links)
- Online scheduling of ordered flow shops (Q1991105) (← links)
- Ideal schedules in parallel machine settings (Q2029359) (← links)
- An improved algorithm for a two-stage production scheduling problem with an outsourcing option (Q2034787) (← links)
- Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs (Q2093193) (← links)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy (Q2116889) (← links)
- COVID-19, flattening the curve, and Benford's law (Q2141894) (← links)
- Two-stage production scheduling with an outsourcing option (Q2275802) (← links)
- Scheduling equal length jobs with eligibility restrictions (Q2288997) (← links)
- An adaptive exponentially weighted moving average-type control chart to monitor the process mean (Q2315643) (← links)
- An improved binary search algorithm for the Multiple-Choice Knapsack Problem (Q2954365) (← links)
- Minimizing the total weighted delivery time in container transportation scheduling (Q3120557) (← links)
- Production scheduling with history-dependent setup times (Q3120636) (← links)
- Forecasting Net Charge-Off Rates of Banks: A PLS Approach (Q5139488) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)
- Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits (Q6547130) (← links)
- Computational complexity of minimal trap spaces in Boolean networks (Q6633132) (← links)
- A systematic approach for learning imbalanced data: enhancing zero-inflated models through boosting (Q6655986) (← links)
