The following pages link to Guohua Wan (Q247908):
Displayed 27 items.
- Several semi-online scheduling problems on two identical machines with combined information (Q714838) (← links)
- Resource-constrained machine scheduling with machine eligibility restriction and its applications to surgical operations scheduling (Q887890) (← links)
- Scheduling two agents with controllable processing times (Q976351) (← links)
- Item:Q247908 (redirect page) (← links)
- Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. (Q1603395) (← links)
- Online scheduling for outpatient services with heterogeneous patients and physicians (Q1740403) (← links)
- Vehicle routing and appointment scheduling with team assignment for home services (Q1782148) (← links)
- Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties (Q1848363) (← links)
- Home service routing and appointment scheduling with stochastic service times (Q2028845) (← links)
- Multi-period lot-sizing with supplier selection: structural results, complexity and algorithms (Q2060614) (← links)
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs (Q2378377) (← links)
- Scheduling imprecise computation tasks on uniform processors (Q2379995) (← links)
- Parallel machine selection and job scheduling to minimize machine cost and job tardiness (Q2387248) (← links)
- Improved algorithm for maximizing service of carousel storage (Q2387261) (← links)
- (Q2720842) (← links)
- A Cluster-Based Context-Tree Model for Multivariate Data Streams with Applications to Anomaly Detection (Q2899128) (← links)
- Competitive Two-Agent Scheduling and Its Applications (Q3100480) (← links)
- THE EFFECT OF FINANCING ON A BUDGET-CONSTRAINED SUPPLY CHAIN UNDER WHOLESALE PRICE CONTRACT (Q3174012) (← links)
- (Q3572613) (← links)
- Single Machine Common Due Window Scheduling with Controllable Job Processing Times (Q3611981) (← links)
- (Q4393134) (← links)
- Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness (Q4632972) (← links)
- Online Order Scheduling Problem with the Same Order Size on Two Identical Machines (Q4978463) (← links)
- Scheduling with variable time slot costs (Q5189246) (← links)
- A Note on Appointment Scheduling with Piecewise Linear Cost Functions (Q5247619) (← links)
- Semi-online scheduling with combined information on two identical machines in parallel (Q5963644) (← links)
- Multi‐level, multi‐stage lot‐sizing and scheduling in the flexible flow shop with demand information updating (Q6091882) (← links)