Scheduling orders for multiple product types with due date related objectives

Document Type

Conference Proceeding

Publication Date

1-16-2006

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 has a release date rj and a due date dj. The different product types for order j can be produced at the same time. We consider various due date related objectives such as the minimization of the maximum lateness Lmax and the total number of late orders ∑Uj. We present polynomial time algorithms for the easy cases and heuristics for NP-hard cases. For minimizing ∑Uj, we also propose an exact algorithm based on Constraint Propagation and bounding strategy. The effectiveness of the algorithms is demonstrated through an empirical study. © 2004 Elsevier B.V. All rights reserved.

Identifier

24944479416 (Scopus)

Publication Title

European Journal of Operational Research

External Full Text Location

https://doi.org/10.1016/j.ejor.2004.03.030

ISSN

03772217

First Page

370

Last Page

389

Issue

2 SPEC. ISS.

Volume

168

Grant

SBR-421350

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS