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

Authors:
Joseph Y. -T. Leung;Haibing Li;Michael Pinedo
Affiliations:
Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA;Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA;Stern School of Business, New York University, 40 West Fourth Street, New York, NY 10012, USA
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 5
Cited 6

Structure of a simple scheduling polyhedron

Mathematical Programming: Series A and B
Scheduling to minimize average completion time: off-line and on-line approximation algorithms

Mathematics of Operations Research
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Order Scheduling in an Environment with Dedicated Resources in Parallel

Journal of Scheduling
A note on the complexity of the concurrent open shop problem

Journal of Scheduling

Distributed order scheduling and its application to multi-core dram controllers

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Inapproximability of hypergraph vertex cover and applications to scheduling problems

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Solving two-machine assembly scheduling problems with inventory constraints

Computers and Industrial Engineering
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders

Mathematics of Operations Research
Minimizing the sum of weighted completion times in a concurrent open shop

Operations Research Letters

Quantified Score

Hi-index	0.04

Visualization

Abstract

We consider the problem of scheduling orders for multiple different product types in an environment with m dedicated machines in parallel. The objective is to minimize the total weighted completion time. Each product type is produced by one and only one of the m dedicated machines; that is, each machine is dedicated to a specific product type. Each order has a weight and may also have a release date. Each order asks for certain amounts of various different product types. The different products for an order can be produced concurrently. Preemptions are not allowed. Even when all orders are available at time 0, the problem has been shown to be strongly NP-hard for any fixed number (=2) of machines. This paper focuses on the design and analysis of efficient heuristics for the case without release dates. Occasionally, however, we extend our results to the case with release dates. The heuristics considered include some that have already been proposed in the literature as well as several new ones. They include various static and dynamic priority rules as well as two more sophisticated LP-based algorithms. We analyze the performance bounds of the priority rules and of the algorithms and present also an in-depth comparative analysis of the various rules and algorithms. The conclusions from this empirical analysis provide insights into the trade-offs with regard to solution quality, speed, and memory space.