Yiwei Jiang

From MaRDI portal
Person:462266

Available identifiers

zbMath Open jiang.yiweiMaRDI QIDQ462266

List of research outcomes





PublicationDate of PublicationType
Online early work scheduling on parallel machines2024-08-13Paper
A unified approach to single-machine scheduling with position-based processing times, machine availability, and job rejection2024-05-28Paper
Single-machine multitasking scheduling with job efficiency promotion2022-08-26Paper
Parallel-machine scheduling in shared manufacturing2022-02-16Paper
https://portal.mardi4nfdi.de/entity/Q49982262021-07-01Paper
https://portal.mardi4nfdi.de/entity/Q33070222020-08-12Paper
A two-stage sequential conditional selection approach to sparse high-dimensional multivariate regression models2020-03-09Paper
MapReduce machine covering problem on a small number of machines2019-12-13Paper
Optimal online algorithms for MapReduce scheduling on two uniform machines2019-10-18Paper
Online scheduling with unit processing times and processing set restrictions2019-10-04Paper
https://portal.mardi4nfdi.de/entity/Q51937362019-09-20Paper
An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines2018-06-11Paper
https://portal.mardi4nfdi.de/entity/Q31310872018-01-29Paper
Competitive analysis of online inventory problem with interrelated prices2018-01-29Paper
Total completion time minimization scheduling on two hierarchical uniform machines2017-11-06Paper
SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS2017-10-20Paper
Total completion time minimization in online hierarchical scheduling of unit-size jobs2017-06-22Paper
A sequential scaled pairwise selection approach to edge detection in nonparanormal graphical models2016-12-19Paper
Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost2016-07-08Paper
Online algorithms for scheduling two parallel machines with a single server2016-05-18Paper
Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines2015-12-11Paper
Single-server parallel-machine scheduling with loading and unloading times2015-07-28Paper
Better approximation algorithms for influence maximization in online social networks2015-07-01Paper
Optimal online algorithms on two hierarchical machines with tightly-grouped processing times2015-05-11Paper
An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop2015-01-30Paper
An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times2014-11-24Paper
Parallel machine covering with limited number of preemptions2014-11-03Paper
Algorithms with limited number of preemptions for scheduling on parallel machines2014-06-24Paper
Parallel Machine Scheduling with a Single Server: Loading and Unloading2013-12-10Paper
Approximation Algorithms for a Two-Stage Hybrid Flow Shop2013-01-24Paper
An improved algorithm for a hybrid flow-shop problem in graphics processing2012-10-05Paper
Optimal online algorithms on two hierarchical machines with resource augmentation2012-08-27Paper
Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines2012-07-16Paper
https://portal.mardi4nfdi.de/entity/Q31700852011-09-29Paper
Optimal Online Algorithms on Two Hierarchical Machines with Resource Augmentation2011-08-17Paper
ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES2011-05-11Paper
Inverse minimum cost flow problems under the weighted Hamming distance2010-09-09Paper
Online parallel machines scheduling with two hierarchies2009-09-10Paper
https://portal.mardi4nfdi.de/entity/Q36107452009-03-06Paper
Online Coupon Consumption Problem2009-03-03Paper
Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost2009-03-03Paper
Online scheduling on parallel machines with two goS levels2008-09-02Paper
Online coupon consumption problem2008-09-02Paper
Parallel machine scheduling problem with two GoS levels2008-04-04Paper
Online Scheduling on Parallel Machines with Two GoS Levels2008-01-04Paper
Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information2007-12-10Paper
Online algorithms for scheduling with machine activation cost on two uniform machines2007-06-27Paper
ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST2007-05-21Paper
Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines2006-12-13Paper
Algorithms and Computation2006-11-14Paper
Preemptive semi-online algorithms for parallel machine scheduling with known total size2006-10-13Paper
Optimal online algorithms for scheduling on two identical machines under a grade of service2006-10-09Paper
OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES2006-04-06Paper
Preemptive machine covering on parallel machines2006-01-13Paper
Advances in Neural Networks – ISNN 20052005-11-23Paper
Optimal semi-online preemptive algorithms for machine covering on two uniform machines2005-06-30Paper
Preemptive online algorithms for scheduling with machine cost2005-05-12Paper
Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines2004-12-09Paper

Research outcomes over time

This page was built for person: Yiwei Jiang