Title

Scheduling Parallel Machines With Machine Eligibility Restrictions Minimizing Total Weighted Tardiness

Keywords

Dispatching rules; Machine eligibility restrictions; Parallel machine scheduling; Total weighted tardiness

Abstract

In this research, we address an interesting and relevant parallel machine scheduling problem that has received little attention by researchers and practitioners to date. The problem, which is motivated by an actual industrial application, considers job release times, due dates and machine eligibility restrictions with the objective of minimizing total weighted tardiness. We propose an effective priority dispatching heuristic and show that our proposed rule competes with the Apparent Tardiness Cost dispatching rule, a widely-accepted benchmark for this particular scheduling objective.

Publication Date

12-1-2007

Publication Title

IIE Annual Conference and Expo 2007 - Industrial Engineering's Critical Role in a Flat World - Conference Proceedings

Number of Pages

968-973

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

Socpus ID

44949180687 (Scopus)

Source API URL

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

This document is currently not available here.

Share

COinS