Parallel machine scheduling about an unrestricted due date and additional resource constraints

Jose Antonio Ventura, Daecheol Kim

Research output: Contribution to journalArticlepeer-review

Abstract

This research considers the problem of schedulingjobs on parallel machines with an unrestricted due date and additional resources. The objective is to minimize the total absolute deviation of job completion times about the common due date. This problem is motivated by restrictions that occur in the handling and processing of jobs in certain phases of semiconductor manufacturing and other production systems. It is shown that the problem is polynomial when there exists one single type of additional resource and the resource requirements per job are zero or one.

Original languageEnglish (US)
Pages (from-to)147-153
Number of pages7
JournalIIE Transactions (Institute of Industrial Engineers)
Volume32
Issue number2
DOIs
StatePublished - Jan 1 2000

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Parallel machine scheduling about an unrestricted due date and additional resource constraints'. Together they form a unique fingerprint.

Cite this