Title

Parallel machine scheduling with release time and machine eligibility restrictions

Keywords

Lateness; Machine eligibility; Parallel machine scheduling; Semiconductor manufacturing

Abstract

We present an algorithm for the problem of minimizing maximum lateness in a parallel machine environment with release dates and machine eligibility restrictions (Pm | rj, Mj | Lmax) for the special case where due dates are equal to release dates plus a constant. No preemption of jobs is allowed. The algorithm has been evaluated using real data from an operational environment of a semiconductor manufacturing firm. Comparison is also made with the actual scheduling system being used by the organization. © 1997 Elsevier Science Ltd.

Publication Date

1-1-1997

Publication Title

Computers and Industrial Engineering

Volume

33

Issue

1-2

Number of Pages

273-276

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/s0360-8352(97)00091-0

Socpus ID

0031246527 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0031246527

This document is currently not available here.

Share

COinS