Joseph Y.-T. Leung

Xue-Xue Zhuo

Comput. Oper. Res., 2019

Integrated production and transportation on parallel batch machines to minimize total weighted delivery time.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2019

Ant colony optimization algorithm for scheduling jobs with fuzzy processing time on parallel batch machines with different capacities.

[BibT_eX]

[DOI]

Appl. Soft Comput., 2019

2018

A meta-heuristic for minimizing total weighted flow time on parallel batch machines.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2018

Integrated bacteria foraging algorithm for cellular manufacturing in supply chain considering facility transfer and production planning.

[BibT_eX]

[DOI]

Chunfeng Liu

Jufeng Wang

Appl. Soft Comput., 2018

2017

Two-agent scheduling of time-dependent jobs.

[BibT_eX]

[DOI]

Cheng He

J. Comb. Optim., 2017

Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights.

[BibT_eX]

[DOI]

Ming-li Pei

Int. J. Syst. Sci., 2017

A multi-objective model for multi-project scheduling and multi-skilled staff assignment for IT product development considering competency evolution.

[BibT_eX]

[DOI]

Int. J. Prod. Res., 2017

Minimizing makespan for arbitrary size jobs with release times on P-batch machines with arbitrary capacities.

[BibT_eX]

[DOI]

Xiaohao Li

Future Gener. Comput. Syst., 2017

Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

Fast approximation algorithms for uniform machine scheduling with processing set restrictions.

[BibT_eX]

[DOI]

C. T. Ng

Eur. J. Oper. Res., 2017

Integrated scheduling on a batch machine to minimize production, inventory and distribution costs.

[BibT_eX]

[DOI]

Bayi Cheng

Eur. J. Oper. Res., 2017

Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times.

[BibT_eX]

[DOI]

José Elías C. Arroyo

Comput. Oper. Res., 2017

An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times.

[BibT_eX]

[DOI]

José Elías C. Arroyo

Comput. Ind. Eng., 2017

Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machines.

[BibT_eX]

[DOI]

Appl. Soft Comput., 2017

2016

An improved binary search algorithm for the Multiple-Choice Knapsack Problem.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2016

Integrated production and delivery with single machine and multiple vehicles.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2016

Scheduling a single machine with parallel batching to minimize makespan and total rejection cost.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Multitasking via alternate and shared processing: Algorithms and complexity.

[BibT_eX]

[DOI]

Nicholas G. Hall

Chung-Lun Li

Discret. Appl. Math., 2016

Worker assignment and production planning with learning and forgetting in manufacturing cells by hybrid bacteria foraging algorithm.

[BibT_eX]

[DOI]

Chunfeng Liu

Jufeng Wang

Comput. Ind. Eng., 2016

An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families.

[BibT_eX]

[DOI]

Chao Wang

Appl. Soft Comput., 2016

Improved algorithms for single machine scheduling with release dates and rejections.

[BibT_eX]

[DOI]

4OR, 2016

2015

Integrated production and delivery on parallel batching machines.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

Integrated scheduling of production and distribution to minimize total cost using an improved ant colony optimization method.

[BibT_eX]

[DOI]

Bayi Cheng

Comput. Ind. Eng., 2015

2014

Two dimensional load balancing.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

Fast approximation algorithms for bi-criteria scheduling with machine assignment costs.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2014

An agent-based intelligent algorithm for uniform machine scheduling to minimize total completion time.

[BibT_eX]

[DOI]

Bayi Cheng

Appl. Soft Comput., 2014

2013

Integrated production and distribution with fixed delivery departure dates.

[BibT_eX]

[DOI]

Zhi-Long Chen

Oper. Res. Lett., 2013

Minimizing maximum lateness of jobs in inventory constrained scheduling.

[BibT_eX]

[DOI]

Dirk Briskorn

J. Oper. Res. Soc., 2013

2012

Berth allocation with time-dependent physical limitations on vessels.

[BibT_eX]

[DOI]

Dongsheng Xu

Chung-Lun Li

Eur. J. Oper. Res., 2012

Coordination mechanisms for parallel machine scheduling.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2012

2011

Exploring the Interplay between Computation and Communication in Distributed Real-Time Scheduling.

[BibT_eX]

[DOI]

Xinfa Hu

Guoliang Xing

IEEE Trans. Computers, 2011

Scheduling jobs with equal processing times subject to machine eligibility constraints.

[BibT_eX]

[DOI]

J. Sched., 2011

Minimizing makespan in an ordered flow shop with machine-dependent processing times.

[BibT_eX]

[DOI]

Byung-Cheon Choi

J. Comb. Optim., 2011

Coordination mechanisms with hybrid local policies.

[BibT_eX]

[DOI]

Discret. Optim., 2011

2010

Fast approximation algorithms for job scheduling with processing set restrictions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Complexity of a scheduling problem with controllable processing times.

[BibT_eX]

[DOI]

Byung-Cheon Choi

Oper. Res. Lett., 2010

A note on makespan minimization in proportionate flow shops.

[BibT_eX]

[DOI]

Byung-Cheon Choi

Inf. Process. Lett., 2010

Competitive Two-Agent Scheduling and Its Applications.

[BibT_eX]

[DOI]

Guohua Wan

Oper. Res., 2010

Scheduling two agents with controllable processing times.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

Parallel machine scheduling with nested processing set restrictions.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

Flow shops with machine maintenance: Ordered and proportionate cases.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

Complexity of single machine scheduling subject to nonnegative inventory constraints.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

Integrated production and delivery scheduling with disjoint windows.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Makespan minimization in online scheduling with machine eligibility.

[BibT_eX]

[DOI]

4OR, 2010

2009

Online scheduling on two uniform machines subject to eligibility constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

A note on graph balancing problems with restrictions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

A note on "An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs".

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Approximation algorithms for multi-agent scheduling to minimize total weighted completion time.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Preemptive Scheduling Algorithms with Nested Processing Set restriction.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions.

[BibT_eX]

[DOI]

Discret. Optim., 2009

2008

Online scheduling of equal-processing-time task systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times.

[BibT_eX]

[DOI]

C. T. Ng

T. C. Edwin Cheng

Eur. J. Oper. Res., 2008

Preemptive multiprocessor order scheduling to minimize total weighted flowtime.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

An asymptotic approximation scheme for the concave cost bin packing problem.

[BibT_eX]

[DOI]

Chung-Lun Li

Eur. J. Oper. Res., 2008

Scheduling problems in master-slave model.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2008

Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2008

Testing Interval Trees for Real-Time Scheduling Systems.

[BibT_eX]

[DOI]

Xinfa Hu

Proceedings of the Fourteenth IEEE Internationl Conference on Embedded and Real-Time Computing Systems and Applications, 2008

Integrating Communication Cost into the Utility Accrual Model for the Resource Allocation in Distributed Real-Time Systems.

[BibT_eX]

[DOI]

Xinfa Hu

Proceedings of the Fourteenth IEEE Internationl Conference on Embedded and Real-Time Computing Systems and Applications, 2008

2007

Imprecise Computation Model.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Real-Time and Embedded Systems., 2007

Imprecise Computation Model.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Real-Time and Embedded Systems., 2007

Approximation Algorithms for Imprecise Computation Tasks with 0/1 Constraint.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Introduction and Overview.

[BibT_eX]

[DOI]

Insup Lee

Sang Hyuk Son

Proceedings of the Handbook of Real-Time and Embedded Systems., 2007

Variable-Sized Bin Packing and Bin Covering.

[BibT_eX]

[DOI]

János Csirik

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Variants of Classical One-Dimensional Bin Packing.

[BibT_eX]

[DOI]

János Csirik

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Complexity of two dual criteria scheduling problems.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2007

Scheduling imprecise computation tasks on uniform processors.

[BibT_eX]

[DOI]

Guohua Wan

Inf. Process. Lett., 2007

Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Scheduling Two-Machine Flow shops with Exact Delays.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2007

Scheduling orders for multiple product types to minimize total weighted completion time.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2006

Minimizing Sum of Completion Times and Makespan in Master-Slave Systems.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2006

Minimizing mean flow time for UET tasks.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

Minimizing total completion time on uniform machines with deadline constraints.

[BibT_eX]

[DOI]

Teofilo F. Gonzalez

ACM Trans. Algorithms, 2006

Two Machine Scheduling under Disruptions with Transportation Considerations.

[BibT_eX]

[DOI]

Chung-Yee Lee

Gang Yu

J. Sched., 2006

Scheduling orders for multiple product types with due date related objectives.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2006

2005

Online Scheduling of Precedence Constrained Tasks.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Order Scheduling in an Environment with Dedicated Resources in Parallel.

[BibT_eX]

[DOI]

J. Sched., 2005

Minimizing total completion time for UET tasks with release time and outtree precedence constraints.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2005

Minimizing mean flowtime and makespan on master-slave systems.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2005

Open shops with jobs overlap - revisited.

[BibT_eX]

[DOI]

Chelliah Sriskandarajah

Eur. J. Oper. Res., 2005

2004

Minimizing TotalWeighted Error for Imprecise Computation Tasks and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Some Basic Scheduling Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

A Tutorial on Complexity.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Introduction and Notation.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Improved Competitive Algorithms For Two-Processor Real-Time Systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2004

A Dual Criteria Preemptive Scheduling Problem For Minimax Error Of Imprecise Computation Tasks.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2004

Minimizing Mean Flowtime on Master-Slave Machines.

[BibT_eX]

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004

2003

Minimizing Total Completion Time on Parallel Machines with Deadline Constraints.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

Average-case analysis of a greedy algorithm for the 0/1 knapsack problem.

[BibT_eX]

[DOI]

James M. Calvin

Oper. Res. Lett., 2003

The Ordered Open-End Bin-Packing Problem.

[BibT_eX]

[DOI]

Jian Yang

Oper. Res., 2003

Heuristics for Generalized Task System.

[BibT_eX]

Chung W. Ng

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2003

1999

Tree Precedence in Scheduling: The Strong-Weak Distinction.

[BibT_eX]

[DOI]

Moshe Dror

Wieslaw Kubiak

Inf. Process. Lett., 1999

1998

Minimizing Mean Flow Time with Error Constraint.

[BibT_eX]

[DOI]

Algorithmica, 1998

1997

Scheduling Imprecise Computation Tasks with 0/1-constraint.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

1996

Probabilistic analysis of a bin covering algorithm.

[BibT_eX]

[DOI]

Sunan Han

Dawei Hong

Oper. Res. Lett., 1996

On-Line Routing of Real-Time Messages.

[BibT_eX]

[DOI]

Tommy W. Tam

J. Parallel Distributed Comput., 1996

Generalized Task System for Parallel Computation.

[BibT_eX]

Xue-Jie Zhang

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1996

1995

Routing Messages with Release Time and Deadline Constraint.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1995

Tighter Bounds on a Heuristic for a Partition Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Probabilistic Analysis of k-Dimensional Packing Algorithms.

[BibT_eX]

[DOI]

Dawei Hong

Inf. Process. Lett., 1995

On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem.

[BibT_eX]

[DOI]

Sunan Han

Dawei Hong

INFORMS J. Comput., 1995

Some properties of nonnegative integral matrices.

[BibT_eX]

Ars Comb., 1995

1994

On Multidimensional Packet Routing for Meshes with Buses.

[BibT_eX]

[DOI]

Sunil M. Shende

J. Parallel Distributed Comput., 1994

Minimizing Maximum Weighted Error for Imprecise Computation Tasks.

[BibT_eX]

[DOI]

J. Algorithms, 1994

Heuristic for Minimizing the Number of Late Jobs on Two Processors.

[BibT_eX]

[DOI]

Vincent K. M. Yu

Int. J. Found. Comput. Sci., 1994

Minimizing the Weighted Number of Tardy Task Units.

[BibT_eX]

[DOI]

Vincent K. M. Yu

Discret. Appl. Math., 1994

1993

Minimizing the Number of Late Tasks with Error Constraint

[BibT_eX]

[DOI]

C. S. Wong

Inf. Comput., September, 1993

Minimizing Mean Flow Time with Release Time and Deadline Constraints.

[BibT_eX]

[DOI]

J. Algorithms, 1993

Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops.

[BibT_eX]

[DOI]

J. Algorithms, 1993

Complexity of Scheduling Tasks with Time-Dependent Execution Times.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

1992

On-Line Scheduling of Real-Time Tasks.

[BibT_eX]

[DOI]

Kwang Soo Hong

IEEE Trans. Computers, 1992

Some Results on Liu's Conjecture.

[BibT_eX]

[DOI]

Kwang Soo Hong

SIAM J. Discret. Math., 1992

A Comparison Theorem for Permanents and a Proof of a Conjecture on (t, m)-Families.

[BibT_eX]

J. Comb. Theory A, 1992

1991

Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time

[BibT_eX]

[DOI]

Inf. Comput., June, 1991

Minimizing the number of late jobs on unrelated machines.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1991

Packet routing on square meshes with row and column buses.

[BibT_eX]

[DOI]

Sunil M. Shende

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

1990

Minimizing Mean Flow Time with Release Time Constraint.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

Minimizing Total Tardiness on One Machine is NP-Hard.

[BibT_eX]

[DOI]

Math. Oper. Res., 1990

Packing Squares into a Square.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1990

Preemptive Scheduling to Minimize Mean Weighted Flow Time.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time.

[BibT_eX]

[DOI]

Lee A. Herrbach

Oper. Res., 1990

Minimizing Total Tardiness on a Single Machine with Precedence Constraints.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1990

1989

Complexity of Scheduling Parallel Task Systems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1989

Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1989

Minimizing Schedule Length Subject to Minimum Flow Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

Preemptive Scheduling with Release Times and Deadlines.

[BibT_eX]

[DOI]

Kwang Soo Hong

Real Time Syst., 1989

Bin Packing with Restricted Piece Sizes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

A New Algorithm for Scheduling Periodic Real-Time Tasks.

[BibT_eX]

[DOI]

Algorithmica, 1989

Minimizing Mean Flow Time with Error Constraint.

[BibT_eX]

[DOI]

Proceedings of the Real-Time Systems Symposium, 1989

1988

Scheduling Tree-Structured Tasks with Restricted Execution Times.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

1985

On the Complexity of Deadlock Recovery.

[BibT_eX]

[DOI]

Burkhard Monien

Proceedings of the STACS 85, 1985

1984

On the 2-Dimensional Channel Assignment Problem.

[BibT_eX]

[DOI]

D. T. Lee

IEEE Trans. Computers, 1984

On Some Variants of the Bandwidth Minimization Problem.

[BibT_eX]

[DOI]

Oliver Vornberger

James D. Witthoff

SIAM J. Comput., 1984

Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 1984

On a Dual Version of the One-Dimensional Bin Packing Problem.

[BibT_eX]

[DOI]

J. Algorithms, 1984

1982

On the complexity of fixed-priority scheduling of periodic, real-time tasks.

[BibT_eX]

[DOI]

Jennifer Whitehead

Perform. Evaluation, 1982

Efficient algorithms for interval graphs and circular-arc graphs.

[BibT_eX]

[DOI]

Udaiprakash I. Gupta

D. T. Lee

Networks, 1982

On Scheduling Independent Tasks with Restricted Execution Times.

[BibT_eX]

[DOI]

Oper. Res., 1982

1981

Record Allocation for Minimizing Seek Delay.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1981

1980

A Note on Preemptive Scheduling of Periodic, Real-Time Tasks.

[BibT_eX]

[DOI]

M. L. Merrill

Inf. Process. Lett., 1980

1979

On Minimum Cost Recovery from System Deadlock.

[BibT_eX]

[DOI]

Edmund K. Lai

IEEE Trans. Computers, 1979

An Optimal Solution for the Channel-Assignment Problem.

[BibT_eX]

[DOI]

Udaiprakash I. Gupta

D. T. Lee

IEEE Trans. Computers, 1979

Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation.

[BibT_eX]

[DOI]

SIAM J. Comput., 1979

Bounds on List Scheduling of UET Tasks with Restricted Resource Constraints.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1979

1978

Bin Packing: Maximizing the Number of Pieces Packed.

[BibT_eX]

[DOI]