Order scheduling in an environment with dedicated resources in parallel

Document Type

Article

Publication Date

10-1-2005

Abstract

We consider m machines in parallel with each machine capable of producing one specific product type. There are n orders with each one requesting specific quantities of the various different product types. Order j may have a release date r j and a due date d j. The different product types for order j can be produced at the same time. We consider the class of objectives Σ fj(Cj) that includes objectives such as the total weighted completion time Σ wjCj and the total weighted tardiness Σ wjTj of the n orders. We present structural properties of the various problems and a complexity result. In particular, we show that minimizing Σ Cj when m ≥ 3 is strongly NP-hard. We introduce two new heuristics for the Σ Cj objective. An empirical analysis shows that our heuristics outperform all heuristics that have been proposed for this problem in the literature. © 2005 Springer Science + Business Media, Inc.

Identifier

23944464445 (Scopus)

Publication Title

Journal of Scheduling

External Full Text Location

https://doi.org/10.1007/s10951-005-2860-x

ISSN

10946136

First Page

355

Last Page

386

Issue

5

Volume

8

Grant

NSF-9977508

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS