The following pages link to Yu-Zhong Zhang (Q402365):
Displayed 50 items.
- (Q230404) (redirect page) (← links)
- On-line scheduling on parallel machines to minimize the makespan (Q328085) (← links)
- Batch scheduling with deteriorating jobs to minimize the total completion time (Q384194) (← links)
- Serial batch scheduling on uniform parallel machines to minimize total completion time (Q402366) (← links)
- Entropy, similarity measure of interval-valued intuitionistic fuzzy sets and their applications (Q433080) (← links)
- Uniform parallel-machine scheduling with time dependent processing times (Q457550) (← links)
- Strong stability of Nash equilibria in load balancing games (Q477108) (← links)
- A linear-time algorithm for clique-coloring problem in circular-arc graphs (Q512872) (← links)
- Scheduling of deteriorating jobs with release dates to minimize the maximum lateness (Q690456) (← links)
- On-line scheduling with rejection on identical parallel machines (Q882532) (← links)
- Inefficiency analysis of the scheduling game on limited identical machines with activation costs (Q903377) (← links)
- An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (Q1016040) (← links)
- On-line scheduling of unit time jobs with rejection on uniform machines (Q1031971) (← links)
- On-line preemptive scheduling on uniform machines (Q1348609) (← links)
- Approximation algorithms in batch processing (Q1417850) (← links)
- Entropy measures for interval-valued intuitionistic fuzzy sets and their application in group decision-making (Q1665999) (← links)
- An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian (Q1707969) (← links)
- Scheduling simple linear deteriorating jobs with rejection (Q1717817) (← links)
- Two-stage medical supply chain scheduling with an assignable common due window and shelf life (Q1740417) (← links)
- Minimizing mean completion time in a batch processing system (Q1879250) (← links)
- Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs (Q1944138) (← links)
- The distributionally robust optimization model for a remanufacturing system under cap-and-trade policy: a newsvendor approach (Q2070772) (← links)
- An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time (Q2084598) (← links)
- A best possible algorithm for an online scheduling problem with position-based learning effect (Q2171076) (← links)
- Improved price of anarchy for machine scheduling games with coordination mechanisms (Q2311122) (← links)
- Scheduling with step-deteriorating jobs to minimize the makespan (Q2315619) (← links)
- Scheduling games on uniform machines with activation cost (Q2344765) (← links)
- Some new results on multi-dimension Knapsack problem (Q2386611) (← links)
- Scheduling with rejection and non-identical job arrivals (Q2425836) (← links)
- Approximation schemes for scheduling a batching machine with nonidentical job size (Q2425843) (← links)
- Duplicating in batch scheduling (Q2468842) (← links)
- Fan-type implicit-heavy subgraphs for Hamiltonicity of implicit claw-heavy graphs (Q2630334) (← links)
- Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost (Q2686108) (← links)
- A best possible algorithm for an online scheduling problem with deteriorating effect in steel box girder section production (Q2691495) (← links)
- Multitasking scheduling with alternate periods (Q2697142) (← links)
- (Q2721842) (← links)
- (Q2721936) (← links)
- (Q2729097) (← links)
- (Q2764433) (← links)
- (Q2778178) (← links)
- (Q2780944) (← links)
- (Q2824188) (← links)
- (Q2825064) (← links)
- (Q2829008) (← links)
- (Q2859740) (← links)
- (Q2886028) (← links)
- (Q2887140) (← links)
- (Q2917961) (← links)
- (Q2923710) (← links)
- (Q2990828) (← links)