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

Jose Antonio Ventura, Daecheol Kim

Research output: Contribution to journalArticle

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

Fingerprint

Scheduling
Polynomials
Semiconductor materials
Processing

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Cite this

@article{387cb1bae8ff41aca8f4ed20a267a6fd,
title = "Parallel machine scheduling about an unrestricted due date and additional resource constraints",
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.",
author = "Ventura, {Jose Antonio} and Daecheol Kim",
year = "2000",
month = "1",
day = "1",
doi = "10.1080/07408170008963887",
language = "English (US)",
volume = "32",
pages = "147--153",
journal = "IISE Transactions",
issn = "2472-5854",
publisher = "Taylor and Francis Ltd.",
number = "2",

}

Parallel machine scheduling about an unrestricted due date and additional resource constraints. / Ventura, Jose Antonio; Kim, Daecheol.

In: IIE Transactions (Institute of Industrial Engineers), Vol. 32, No. 2, 01.01.2000, p. 147-153.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Ventura, Jose Antonio

AU - Kim, Daecheol

PY - 2000/1/1

Y1 - 2000/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85023837450&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85023837450&partnerID=8YFLogxK

U2 - 10.1080/07408170008963887

DO - 10.1080/07408170008963887

M3 - Article

AN - SCOPUS:85023837450

VL - 32

SP - 147

EP - 153

JO - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 2

ER -