| Publication | Date of Publication | Type |
|---|
Scheduling with periodic availability constraints to minimize makespan
Journal of Scheduling | 2024-07-23 | Paper |
Mixed coordination mechanisms for scheduling games on hierarchical machines
International Transactions in Operational Research | 2023-11-21 | Paper |
Coordination mechanisms for scheduling games with machine modification
International Transactions in Operational Research | 2023-11-20 | Paper |
Online scheduling on parallel machines: a survey
SCIENTIA SINICA Mathematica | 2022-03-21 | Paper |
Batch scheduling of nonidentical job sizes with minsum criteria
Journal of Combinatorial Optimization | 2021-11-25 | Paper |
| Scheduling game with machine modification in the random setting | 2020-05-13 | Paper |
Online scheduling with unit processing times and processing set restrictions
Journal of the Operations Research Society of China | 2019-10-04 | Paper |
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
CEJOR. Central European Journal of Operations Research | 2019-09-02 | Paper |
Improved bounds for batch scheduling with nonidentical job sizes
Naval Research Logistics | 2019-05-02 | Paper |
Pseudo lower bounds for online parallel machine scheduling
Operations Research Letters | 2018-09-28 | Paper |
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
CEJOR. Central European Journal of Operations Research | 2018-06-15 | Paper |
Lower bound for 3-batched bin packing
Discrete Optimization | 2018-05-24 | Paper |
| Minimizing total completion time of batch scheduling with nonidentical job sizes | 2018-02-26 | Paper |
Coordination mechanisms for scheduling games with proportional deterioration
European Journal of Operational Research | 2018-02-06 | Paper |
Scheduling to minimize the maximum total completion time per machine
European Journal of Operational Research | 2016-07-08 | Paper |
Inefficiency of equilibria for scheduling game with machine activation costs
Theoretical Computer Science | 2015-12-08 | Paper |
Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
Information Sciences | 2015-09-24 | Paper |
A new approach for bicriteria partitioning problem
Optimization Letters | 2015-07-22 | Paper |
A note on the lower bound for the price of anarchy of scheduling games on unrelated machines
Discrete Applied Mathematics | 2015-05-22 | Paper |
The PoA of Scheduling Game with Machine Activation Costs
Frontiers in Algorithmics | 2014-09-02 | Paper |
Inefficiency of Nash equilibria with parallel processing policy
Information Processing Letters | 2014-04-11 | Paper |
Privacy-preserving vertically partitioned linear program with nonnegativity constraints
Optimization Letters | 2014-01-30 | Paper |
Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis
Theoretical Computer Science | 2014-01-22 | Paper |
On the optimality of list scheduling for online uniform machines scheduling
Optimization Letters | 2012-12-11 | Paper |
Inefficiency of equilibria for the machine covering game on uniform machines
Acta Informatica | 2012-10-15 | Paper |
New upper and lower bounds for online scheduling with machine cost
Discrete Optimization | 2012-06-20 | Paper |
Parallel machines scheduling with machine maintenance for minsum criteria
European Journal of Operational Research | 2012-05-14 | Paper |
Single machine scheduling with semi-resumable machine availability constraints
Applied Mathematics. Series B (English Edition) | 2012-01-27 | Paper |
Single machine scheduling with an operator non-availability period to minimize total completion time
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
Online and semi-online scheduling on capacitated two-parallel machines
Asia-Pacific Journal of Operational Research | 2011-05-11 | Paper |
Online hierarchical scheduling: an approach using mathematical programming
Theoretical Computer Science | 2011-01-28 | Paper |
A note on hierarchical scheduling on two uniform machines
Journal of Combinatorial Optimization | 2010-11-12 | Paper |
Tighter bounds of the First Fit algorithm for the bin-packing problem
Discrete Applied Mathematics | 2010-11-05 | Paper |
Semi-online machine covering for two uniform machines
Theoretical Computer Science | 2009-11-06 | Paper |
Online parallel machines scheduling with two hierarchies
Theoretical Computer Science | 2009-09-10 | Paper |
A Mathematical Programming Approach for Online Hierarchical Scheduling
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
| Randomized on-line and semi-on-line scheduling on identical machines | 2009-05-22 | Paper |
Bounds on delay start LPT algorithm for scheduling on two identical machines in the \(l_p\) norm
Journal of Industrial and Management Optimization | 2009-03-30 | Paper |
Optimal Semi-online Scheduling Algorithms on a Small Number of Machines
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
Online Coupon Consumption Problem
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
Online coupon consumption problem
Journal of Combinatorial Optimization | 2008-09-02 | Paper |
Online scheduling with reassignment
Operations Research Letters | 2008-08-06 | Paper |
In memoriam: Yong He (1969--2005)
Journal of Combinatorial Optimization | 2007-10-12 | Paper |
On the machine scheduling problem with job delivery coordination
European Journal of Operational Research | 2007-06-13 | Paper |
Semi-online scheduling problems on two identical machines with inexact partial information
Theoretical Computer Science | 2007-06-06 | Paper |
Optimal semi-online algorithms for machine covering
Theoretical Computer Science | 2007-03-15 | Paper |
Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system
Science in China. Series F | 2007-02-20 | Paper |
Linear time algorithms for parallel machine scheduling
Acta Mathematica Sinica, English Series | 2006-12-13 | Paper |
| Semi-online scheduling on two identical processors with two types of partial information | 2006-03-13 | Paper |
| scientific article; zbMATH DE number 5012227 (Why is no real title available?) | 2006-03-13 | Paper |
Preemptive machine covering on parallel machines
Journal of Combinatorial Optimization | 2006-01-13 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithmic Applications in Management
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
Information and Computation | 2005-03-08 | Paper |
\(\kappa\)-partitioning problems for maximizing the minimum load
Computers & Mathematics with Applications | 2004-09-23 | Paper |
| scientific article; zbMATH DE number 2077624 (Why is no real title available?) | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 1930822 (Why is no real title available?) | 2003-09-09 | Paper |
Semi-on-line problems on two identical machines with combined partial information
Operations Research Letters | 2003-05-04 | Paper |
| scientific article; zbMATH DE number 1894930 (Why is no real title available?) | 2003-04-08 | Paper |
Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
Information Processing Letters | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1810114 (Why is no real title available?) | 2002-09-30 | Paper |
Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
Computers & Mathematics with Applications | 2002-08-15 | Paper |
| scientific article; zbMATH DE number 1696639 (Why is no real title available?) | 2002-07-22 | Paper |
Ordinal on-line scheduling for maximizing the minimum machine completion time
Journal of Combinatorial Optimization | 2002-05-28 | Paper |
| scientific article; zbMATH DE number 1932350 (Why is no real title available?) | 2002-01-01 | Paper |
Semi-on-line scheduling with ordinal data on two uniform machines
Operations Research Letters | 2001-10-10 | Paper |
