| Publication | Date of Publication | Type |
|---|
| Streaming algorithms for scheduling jobs with priorities | 2026-01-13 | Paper |
Sublinear time approximation schemes for makespan minimization on parallel machines
Mathematical Methods of Operations Research | 2025-08-01 | Paper |
| Sublinear algorithms for scheduling with chain precedence constraints | 2025-06-17 | Paper |
Multitasking scheduling with shared processing
Naval Research Logistics | 2024-05-14 | Paper |
Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity
Theoretical Computer Science | 2023-05-23 | Paper |
Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity
Theoretical Computer Science | 2023-05-23 | Paper |
Streaming algorithms for multitasking scheduling with shared processing
Discrete Applied Mathematics | 2022-08-24 | Paper |
Parallel machine makespan minimization subject to machine availability and total completion time constraints
Journal of Scheduling | 2020-03-06 | Paper |
In memoriam: Dr. Joseph Leung
Journal of Scheduling | 2019-08-08 | Paper |
Total completion time minimization on multiple machines subject to machine availability and makespan constraints
European Journal of Operational Research | 2016-10-06 | Paper |
Minimizing mean flow time for UET tasks
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Makespan minimization on multiple machines subject to machine unavailability and total completion time constraints
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Minimizing total weighted completion time with an unexpected machine unavailable interval
Journal of Scheduling | 2014-08-18 | Paper |
Bi-criteria scheduling on multiple machines subject to machine availability constraints
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
Minimizing total weighted completion time with unexpected machine unavailability
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
Coordinated scheduling of production and delivery with production window and delivery capacity constraints
Theoretical Computer Science | 2012-05-14 | Paper |
Fast approximation algorithms for job scheduling with processing set restrictions
Theoretical Computer Science | 2012-04-03 | Paper |
Approximation schemes for parallel machine scheduling with availability constraints
Discrete Applied Mathematics | 2011-10-27 | Paper |
Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints
Theoretical Computer Science | 2011-03-14 | Paper |
Approximation schemes for scheduling with availability constraints
Frontiers in Algorithmics | 2010-09-07 | Paper |
Coordinated scheduling of production and delivery with production window and delivery capacity constraints
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
Integrated production and delivery scheduling with disjoint windows
Discrete Applied Mathematics | 2010-05-25 | Paper |
Parallel machine scheduling with nested processing set restrictions
European Journal of Operational Research | 2010-01-25 | Paper |
Preemptive scheduling algorithms with nested processing set restriction
International Journal of Foundations of Computer Science | 2010-01-08 | Paper |
MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
Discrete Mathematics, Algorithms and Applications | 2009-09-22 | Paper |
A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
Discrete Optimization | 2009-08-19 | Paper |
Exponential inapproximability and FPTAS for scheduling with availability constraints
Theoretical Computer Science | 2009-07-10 | Paper |
Integrated Production and Delivery Scheduling with Disjoint Windows
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
Makespan Minimization with Machine Availability Constraints
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
Minimizing total completion time in two-machine flow shops with exact delays
Computers & Operations Research | 2009-02-12 | Paper |
Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Online scheduling of equal-processing-time task systems
Theoretical Computer Science | 2008-07-31 | Paper |
Complexity of two dual criteria scheduling problems
Operations Research Letters | 2007-08-27 | Paper |
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
European Journal of Operational Research | 2006-12-07 | Paper |
Minimizing total completion time for UET tasks with release time and outtree precedence constraints
Mathematical Methods of Operations Research | 2006-10-27 | Paper |
Online Scheduling of Precedence Constrained Tasks
SIAM Journal on Computing | 2005-09-16 | Paper |
