Parallel Machine Scheduling With Release Time And Machine Eligibility Restrictions

    Authors

    G. Centeno;R. L. Armacost

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    Comput. Ind. Eng.

    Keywords

    Machine Eligibility; Lateness; Semiconductor Manufacturing; Parallel; Machine Scheduling; Computer Science, Interdisciplinary Applications; Engineering, ; Industrial

    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\r(j),M-j\L-max) 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. (C) 1997 Elsevier Science Ltd.

    Journal Title

    Computers & Industrial Engineering

    Volume

    33

    Issue/Number

    1-2

    Publication Date

    1-1-1997

    Document Type

    Article; Proceedings Paper

    Language

    English

    First Page

    273

    Last Page

    276

    WOS Identifier

    WOS:A1997YL31400066

    ISSN

    0360-8352

    Share

    COinS