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

Document Type

Article

Publication Date

7-31-2007

Abstract

We consider the scheduling of orders in an environment with m uniform machines in parallel. Each order requests certain amounts of k different product types. Each product type can be produced by any one of the m machines. No setup is required if a machine switches over from one product type to another. Different product types intended for the same order can be produced at the same time (concurrently) on different machines. Each order is released at time zero and has a positive weight. Preemptions are allowed. The completion time of an order is the finish time of the product type that is completed last for that order. The objective is to minimize the total weighted completion time. We propose heuristics for the non-preemptive as well as the preemptive case and obtain worst case bounds that are a function of the number of machines as well as the differences in the speeds of the machines. Even though the worst-case bounds we showed for the two heuristics are not very tight, our experimental results show that they yield solutions that are very close to optimal. © 2007 Elsevier B.V. All rights reserved.

Identifier

34248187699 (Scopus)

Publication Title

Information Processing Letters

External Full Text Location

https://doi.org/10.1016/j.ipl.2007.03.002

ISSN

00200190

First Page

119

Last Page

129

Issue

3

Volume

103

Grant

DMI-0245603

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS