Yu-Zhong Zhang

From MaRDI portal
Person:402365

Available identifiers

zbMath Open zhang.yuzhongMaRDI QIDQ402365

List of research outcomes

PublicationDate of PublicationType
A best possible online algorithm for minimizing the total completion time and the total soft penalty cost2024-01-22Paper
Multitasking scheduling with alternate periods2023-04-18Paper
A best possible algorithm for an online scheduling problem with deteriorating effect in steel box girder section production2023-03-29Paper
Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost2023-02-24Paper
An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time2022-10-18Paper
A best possible algorithm for an online scheduling problem with position-based learning effect2022-09-23Paper
https://portal.mardi4nfdi.de/entity/Q50628702022-03-17Paper
A Semi-Online Algorithm for Single Machine Scheduling with Rejection2022-02-01Paper
Pareto-optimal Algorithms for Scheduling Games on Parallel-batching Machines with Activation Cost2022-02-01Paper
The distributionally robust optimization model for a remanufacturing system under cap-and-trade policy: a newsvendor approach2022-01-24Paper
https://portal.mardi4nfdi.de/entity/Q52347762019-10-02Paper
Scheduling with step-deteriorating jobs to minimize the makespan2019-07-25Paper
Improved price of anarchy for machine scheduling games with coordination mechanisms2019-07-10Paper
Two-stage medical supply chain scheduling with an assignable common due window and shelf life2019-04-30Paper
Scheduling simple linear deteriorating jobs with rejection2019-02-08Paper
https://portal.mardi4nfdi.de/entity/Q46886882018-10-22Paper
https://portal.mardi4nfdi.de/entity/Q46908512018-10-22Paper
Entropy measures for interval-valued intuitionistic fuzzy sets and their application in group decision-making2018-08-27Paper
https://portal.mardi4nfdi.de/entity/Q31760592018-07-18Paper
An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian2018-04-04Paper
https://portal.mardi4nfdi.de/entity/Q31326422018-01-29Paper
The Supplying Chain Scheduling with Outsourcing and Transportation2017-08-10Paper
https://portal.mardi4nfdi.de/entity/Q52774762017-07-14Paper
https://portal.mardi4nfdi.de/entity/Q52826612017-07-14Paper
https://portal.mardi4nfdi.de/entity/Q52826712017-07-14Paper
A linear-time algorithm for clique-coloring problem in circular-arc graphs2017-03-03Paper
https://portal.mardi4nfdi.de/entity/Q28290082016-10-26Paper
On-line scheduling on parallel machines to minimize the makespan2016-10-20Paper
https://portal.mardi4nfdi.de/entity/Q28241882016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q28250642016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q29908282016-08-10Paper
Scheduling and Outsourcing with Multiple Customers2016-08-10Paper
Fan-type implicit-heavy subgraphs for Hamiltonicity of implicit claw-heavy graphs2016-07-27Paper
https://portal.mardi4nfdi.de/entity/Q34611642016-01-15Paper
Inefficiency analysis of the scheduling game on limited identical machines with activation costs2016-01-05Paper
https://portal.mardi4nfdi.de/entity/Q31935172015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q31958772015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q52603122015-06-29Paper
Scheduling games on uniform machines with activation cost2015-05-18Paper
Strong stability of Nash equilibria in load balancing games2014-12-02Paper
https://portal.mardi4nfdi.de/entity/Q29237102014-11-03Paper
Uniform parallel-machine scheduling with time dependent processing times2014-09-29Paper
Serial batch scheduling on uniform parallel machines to minimize total completion time2014-08-28Paper
https://portal.mardi4nfdi.de/entity/Q49807922014-06-30Paper
https://portal.mardi4nfdi.de/entity/Q53995062014-02-28Paper
https://portal.mardi4nfdi.de/entity/Q54000332014-02-28Paper
Batch scheduling with deteriorating jobs to minimize the total completion time2013-11-27Paper
https://portal.mardi4nfdi.de/entity/Q28597402013-11-19Paper
Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs2013-04-04Paper
https://portal.mardi4nfdi.de/entity/Q49009562013-01-24Paper
Scheduling of deteriorating jobs with release dates to minimize the maximum lateness2012-11-27Paper
https://portal.mardi4nfdi.de/entity/Q29179612012-10-05Paper
Entropy, similarity measure of interval-valued intuitionistic fuzzy sets and their applications2012-07-13Paper
https://portal.mardi4nfdi.de/entity/Q28860282012-06-01Paper
https://portal.mardi4nfdi.de/entity/Q28871402012-06-01Paper
https://portal.mardi4nfdi.de/entity/Q31092252012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q31702182011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q31709732011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q31709772011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q30740452011-02-14Paper
https://portal.mardi4nfdi.de/entity/Q30518342010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q30540732010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q30545782010-11-05Paper
SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN2010-11-01Paper
https://portal.mardi4nfdi.de/entity/Q35855372010-08-20Paper
Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines2010-07-20Paper
https://portal.mardi4nfdi.de/entity/Q35512162010-04-15Paper
https://portal.mardi4nfdi.de/entity/Q36411772009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36411832009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36419872009-11-11Paper
On-line scheduling of unit time jobs with rejection on uniform machines2009-10-23Paper
THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE2009-08-14Paper
Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine2009-07-07Paper
Scheduling with Rejection to Minimize the Makespan2009-07-07Paper
An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan2009-05-04Paper
https://portal.mardi4nfdi.de/entity/Q36099662009-03-06Paper
An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan2009-03-03Paper
https://portal.mardi4nfdi.de/entity/Q35378472008-11-24Paper
https://portal.mardi4nfdi.de/entity/Q35131442008-08-06Paper
Scheduling with rejection and non-identical job arrivals2008-05-07Paper
Approximation schemes for scheduling a batching machine with nonidentical job size2008-05-07Paper
Duplicating in batch scheduling2008-02-11Paper
https://portal.mardi4nfdi.de/entity/Q54312742007-12-07Paper
https://portal.mardi4nfdi.de/entity/Q34456442007-06-12Paper
https://portal.mardi4nfdi.de/entity/Q34456462007-06-12Paper
https://portal.mardi4nfdi.de/entity/Q34456472007-06-12Paper
https://portal.mardi4nfdi.de/entity/Q34456492007-06-12Paper
On-line scheduling with rejection on identical parallel machines2007-05-24Paper
Theory and Applications of Models of Computation2007-04-30Paper
https://portal.mardi4nfdi.de/entity/Q34288152007-03-29Paper
https://portal.mardi4nfdi.de/entity/Q34172382007-01-29Paper
https://portal.mardi4nfdi.de/entity/Q54835742006-08-23Paper
Algorithmic Applications in Management2005-11-30Paper
https://portal.mardi4nfdi.de/entity/Q57092772005-11-29Paper
https://portal.mardi4nfdi.de/entity/Q56981232005-10-27Paper
Some new results on multi-dimension Knapsack problem2005-09-01Paper
https://portal.mardi4nfdi.de/entity/Q54622442005-08-01Paper
https://portal.mardi4nfdi.de/entity/Q30233192005-07-04Paper
Minimizing mean completion time in a batch processing system2004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q44711602004-06-18Paper
Approximation algorithms in batch processing2004-01-06Paper
https://portal.mardi4nfdi.de/entity/Q44158682003-08-07Paper
https://portal.mardi4nfdi.de/entity/Q47832782002-12-04Paper
https://portal.mardi4nfdi.de/entity/Q31517202002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q31479702002-09-30Paper
On-line preemptive scheduling on uniform machines2002-05-14Paper
https://portal.mardi4nfdi.de/entity/Q27644332002-04-23Paper
https://portal.mardi4nfdi.de/entity/Q27809442002-04-10Paper
Global convergence property of \(s\)-dependent GFR conjugate gradient method2002-02-18Paper
https://portal.mardi4nfdi.de/entity/Q45433542002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47096392002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q43887562001-11-27Paper
https://portal.mardi4nfdi.de/entity/Q27290972001-10-23Paper
https://portal.mardi4nfdi.de/entity/Q45269462001-09-13Paper
https://portal.mardi4nfdi.de/entity/Q27218422001-07-11Paper
https://portal.mardi4nfdi.de/entity/Q27219362001-07-11Paper
https://portal.mardi4nfdi.de/entity/Q45023802001-05-20Paper
https://portal.mardi4nfdi.de/entity/Q45283612001-01-31Paper
https://portal.mardi4nfdi.de/entity/Q27781782001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42673132000-10-10Paper
https://portal.mardi4nfdi.de/entity/Q45038642000-09-14Paper
https://portal.mardi4nfdi.de/entity/Q44894172000-07-11Paper
https://portal.mardi4nfdi.de/entity/Q42428382000-01-10Paper
https://portal.mardi4nfdi.de/entity/Q42381991999-07-06Paper
https://portal.mardi4nfdi.de/entity/Q42118501999-03-02Paper
https://portal.mardi4nfdi.de/entity/Q43845031998-08-23Paper
https://portal.mardi4nfdi.de/entity/Q43681921998-07-06Paper
https://portal.mardi4nfdi.de/entity/Q43589301997-11-20Paper
https://portal.mardi4nfdi.de/entity/Q31292131997-04-27Paper
https://portal.mardi4nfdi.de/entity/Q48703911996-03-18Paper
https://portal.mardi4nfdi.de/entity/Q40377661993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40378651993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q39742781992-06-25Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Yu-Zhong Zhang