Joseph Y.-T. Leung

From MaRDI portal
Revision as of 06:34, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Joseph Y.-T. Leung to Joseph Y.-T. Leung: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:210310

Available identifiers

zbMath Open leung.joseph-y-tMaRDI QIDQ210310

List of research outcomes





PublicationDate of PublicationType
Single batch machine scheduling with deliveries2019-05-02Paper
Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost2019-05-02Paper
Integrated optimization of material supplying, manufacturing, and product distribution: models and fast algorithms2019-03-28Paper
Minimizing the total weighted delivery time in container transportation scheduling2019-03-05Paper
Integrated production and transportation on parallel batch machines to minimize total weighted delivery time2018-12-03Paper
Two dimensional load balancing2018-09-28Paper
Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times2018-07-11Paper
Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes2018-05-25Paper
Integrated scheduling on a batch machine to minimize production, inventory and distribution costs2018-02-16Paper
Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine2018-02-06Paper
Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights2018-01-05Paper
Two-agent scheduling of time-dependent jobs2017-10-17Paper
Exploring the Interplay between Computation and Communication in Distributed Real-Time Scheduling2017-07-27Paper
Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times2017-06-12Paper
An improved binary search algorithm for the Multiple-Choice Knapsack Problem2017-01-12Paper
An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes2016-11-10Paper
Integrated production and delivery on parallel batching machines2016-10-06Paper
Fast approximation algorithms for bi-criteria scheduling with machine assignment costs2016-06-23Paper
A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes2016-06-23Paper
Multitasking via alternate and shared processing: algorithms and complexity2016-05-18Paper
Scheduling a single machine with parallel batching to minimize makespan and total rejection cost2016-04-07Paper
Improved algorithms for single machine scheduling with release dates and rejections2016-03-29Paper
Minimizing total completion time on uniform machines with deadline constraints2015-09-02Paper
Minimizing mean flow time for UET tasks2015-09-02Paper
Integrated production and distribution with fixed delivery departure dates2014-05-14Paper
Makespan minimization in online scheduling with machine eligibility2013-08-08Paper
Multiple subset sum with inclusive assignment set restrictions2013-06-27Paper
A note on makespan minimization in proportionate flow shops2013-04-04Paper
Coordination mechanisms for parallel machine scheduling2012-12-29Paper
Berth allocation with time-dependent physical limitations on vessels2012-05-14Paper
Coordination mechanisms with hybrid local policies2012-04-05Paper
Minimizing makespan in an ordered flow shop with machine-dependent processing times2012-04-04Paper
Fast approximation algorithms for job scheduling with processing set restrictions2012-04-03Paper
Competitive Two-Agent Scheduling and Its Applications2011-11-24Paper
Makespan minimization in online scheduling with machine eligibility2011-04-01Paper
Scheduling jobs with equal processing times subject to machine eligibility constraints2011-04-01Paper
Flow shops with machine maintenance: ordered and proportionate cases2010-09-09Paper
Complexity of single machine scheduling subject to nonnegative inventory constraints2010-09-09Paper
A note on graph balancing problems with restrictions2010-09-02Paper
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time2010-08-20Paper
A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs2010-08-16Paper
Scheduling two agents with controllable processing times2010-06-11Paper
Integrated production and delivery scheduling with disjoint windows2010-05-25Paper
Complexity of a scheduling problem with controllable processing times2010-05-07Paper
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines2010-03-24Paper
Scheduling imprecise computation tasks on uniform processors2010-03-24Paper
Parallel machine scheduling with nested processing set restrictions2010-01-25Paper
PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION2010-01-08Paper
Online scheduling on two uniform machines subject to eligibility constraints2009-09-10Paper
A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions2009-08-19Paper
The Ordered Open-End Bin-Packing Problem2009-07-09Paper
Integrated Production and Delivery Scheduling with Disjoint Windows2009-07-07Paper
Scheduling multiple products on parallel machines with setup costs2009-05-13Paper
Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time2008-09-03Paper
Scheduling problems in master-slave model2008-09-03Paper
Scheduling parallel machines with inclusive processing set restrictions2008-08-11Paper
Online scheduling of equal-processing-time task systems2008-07-31Paper
An asymptotic approximation scheme for the concave cost bin packing problem2008-07-21Paper
Preemptive multiprocessor order scheduling to minimize total weighted flowtime2008-04-24Paper
Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel2008-01-23Paper
Complexity of two dual criteria scheduling problems2007-08-27Paper
Scheduling orders for multiple product types to minimize total weighted completion time2007-05-30Paper
Order scheduling in an environment with dedicated resources in parallel2007-05-15Paper
Two machine scheduling under disruptions with transportation considerations2007-05-15Paper
SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS2007-04-25Paper
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness2006-12-07Paper
Minimizing total completion time for UET tasks with release time and outtree precedence constraints2006-10-27Paper
https://portal.mardi4nfdi.de/entity/Q57023082005-11-01Paper
Scheduling orders for multiple product types with due date related objectives2005-10-17Paper
Online Scheduling of Precedence Constrained Tasks2005-09-16Paper
Minimizing mean flowtime and makespan on master-slave systems2005-06-30Paper
A generalization of the weighted set covering problem2005-04-21Paper
A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS2005-04-18Paper
IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS2005-04-18Paper
A note on scheduling parallel machines subject to breakdown and repair2005-02-22Paper
Open shops with jobs overlap -- revisited2005-02-09Paper
Minimizing Total Completion Time on Parallel Machines with Deadline Constraints2003-09-28Paper
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem.2003-06-17Paper
A dual criteria sequencing problem with earliness and tardiness penalties2002-09-03Paper
Tree precedence in scheduling: The strong-weak distinction2002-07-25Paper
A note on an open-end bin packing problem2001-10-14Paper
Split-delivery routeing heuristics in livestock feed distribution1998-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43510851998-05-13Paper
On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem1997-04-10Paper
Probabilistic analysis of a bin covering algorithm1996-08-01Paper
HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS1995-10-29Paper
On multidimensional packet routing for meshes with buses1994-05-15Paper
Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops1993-05-16Paper
Minimizing Mean Flow Time With Release Time and Deadline Constraints1993-05-16Paper
Some Results on Liu’s Conjecture1993-04-01Paper
Minimizing Total Tardiness on a Single Machine with Precedence Constraints1993-02-18Paper
Scheduling chain-structured tasks to minimize makespan and mean flow time1992-06-25Paper
Minimizing the number of late jobs on unrelated machines1991-01-01Paper
Preemptive scheduling to minimize mean weighted flow time1990-01-01Paper
Minimizing mean flow time with release time constraint1990-01-01Paper
Minimizing Total Tardiness on One Machine is NP-Hard1990-01-01Paper
Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time1990-01-01Paper
A new algorithm for scheduling periodic, real-time tasks1989-01-01Paper
Bin packing with restricted piece sizes1989-01-01Paper
Minimizing Schedule Length Subject to Minimum Flow Time1989-01-01Paper
Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length1989-01-01Paper
Complexity of Scheduling Parallel Task Systems1989-01-01Paper
Scheduling tree-structured tasks with restricted execution times1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37835571986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37410511985-01-01Paper
On a dual version of the one-dimensional bin packing problem1984-01-01Paper
Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs1984-01-01Paper
On Some Variants of the Bandwidth Minimization Problem1984-01-01Paper
On Scheduling Independent Tasks with Restricted Execution Times1982-01-01Paper
On the complexity of fixed-priority scheduling of periodic, real-time tasks1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47416981981-01-01Paper
A note on preemptive scheduling of periodic, real-time tasks1980-01-01Paper
Bounds on list scheduling of UET tasks with restricted resource constraints1979-01-01Paper
On Minimum Cost Recovery from System Deadlock1979-01-01Paper
Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation1979-01-01Paper
Bin packing: Maximizing the number of pieces packed1978-01-01Paper
An efficient algorithm for allocating paged, drum-like storage1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41822271978-01-01Paper

Research outcomes over time

This page was built for person: Joseph Y.-T. Leung