The following pages link to Guo-Chuan Zhang (Q489133):
Displaying 50 items.
- (Q170465) (redirect page) (← links)
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer (Q290202) (← links)
- Approximate composable truthful mechanism design (Q344791) (← links)
- Approximation algorithms for a bi-level knapsack problem (Q391212) (← links)
- Strategy-proof approximation mechanisms for an obnoxious facility game on networks (Q391236) (← links)
- On two-machine flow shop scheduling (Q489134) (← links)
- Online multiple-strip packing (Q621841) (← links)
- A new version of on-line variable-sized bin packing (Q674434) (← links)
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval (Q726392) (← links)
- Maximizing the throughput of parallel jobs on hypercubes (Q846023) (← links)
- On-line scheduling mesh jobs with dependencies (Q870843) (← links)
- Maximizing the total profit of rectangles packed into a rectangle (Q878442) (← links)
- An asymptotic competitive scheme for online bin packing (Q896124) (← links)
- Online removable square packing (Q927402) (← links)
- On-line scheduling of parallel jobs in a list (Q954256) (← links)
- On-line scheduling of parallel jobs on two machines (Q954945) (← links)
- Deterministic on-line call control in cellular networks (Q982658) (← links)
- Optimal online-list batch scheduling (Q990939) (← links)
- On-line scheduling of multi-core processor tasks with virtualization (Q991470) (← links)
- On-line scheduling with extendable working time on a small number of machines (Q1007518) (← links)
- Hardness of lazy packing and covering (Q1015303) (← links)
- Scheduling with a minimum number of machines (Q1015305) (← links)
- A note on online strip packing (Q1029271) (← links)
- The FFD algorithm for the bin packing problem with kernel items (Q1272734) (← links)
- A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing (Q1299865) (← links)
- Semi on-line scheduling on two identical machines (Q1300219) (← links)
- Optimal on-line algorithms for variable-sized bin covering (Q1306350) (← links)
- Tight performance bound of \(AFBk\) bin packing (Q1375348) (← links)
- Parameterized on-line open-end bin packing (Q1387710) (← links)
- On maximizing the throughput of multiprocessor tasks. (Q1401335) (← links)
- A new approximation algorithm for UET-scheduling with chain-type precedence constraints. (Q1406686) (← links)
- A constrained minimum spanning tree problem (Q1571033) (← links)
- Algorithmic analysis for ridesharing of personal vehicles (Q1630989) (← links)
- On the optimality of exact and approximation algorithms for scheduling problems (Q1635503) (← links)
- Online knapsack with resource augmentation (Q1675784) (← links)
- Cost-sharing mechanisms for selfish bin packing (Q1699799) (← links)
- Online lazy bureaucrat scheduling with a machine deadline (Q1702835) (← links)
- The price of anarchy in two-stage scheduling games (Q1708612) (← links)
- Parallel machine scheduling with speed-up resources (Q1754306) (← links)
- An improved lower bound for rank four scheduling (Q1785250) (← links)
- The path set packing problem (Q1790987) (← links)
- A note on on-line scheduling with partial information (Q1886493) (← links)
- Approximation schemes for two-machine flow shop scheduling with two agents (Q1928514) (← links)
- Scheduling on two identical machines with a speed-up resource (Q1944144) (← links)
- On the price of anarchy of two-stage machine scheduling games (Q2051911) (← links)
- From packing rules to cost-sharing mechanisms (Q2082177) (← links)
- Truthful mechanism design for bin packing with applications on cloud computing (Q2084605) (← links)
- Two-facility location games with a minimum distance requirement on a circle (Q2150574) (← links)
- The \(k\)-delivery traveling salesman problem: revisited (Q2180148) (← links)
- Weighted throughput maximization with calibrations (Q2285098) (← links)
