Job shop scheduling with two jobs and nonregular objective functions

A. Agnetis; P. B. Mirchandani; D. Pacciarelli; A. Pacifici

doi:10.1080/03155986.2001.11732439

Job shop scheduling with two jobs and nonregular objective functions

A. Agnetis, P. B. Mirchandani, D. Pacciarelli, A. Pacifici

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

We consider the job shop scheduling problem with two jobs. We consider a broad class of non-regular, quasi-convex functions of the completion time of the two jobs. We show that the optimal solution, for this class of objective functions, can be computed in O(r log r + log H) time, where r is the number of operation pairs using the same machine, and H is the maximum operation processing time.

Original language	English (US)
Pages (from-to)	227-244
Number of pages	18
Journal	INFOR
Volume	39
Issue number	3
DOIs	https://doi.org/10.1080/03155986.2001.11732439
State	Published - Aug 2001
Externally published	Yes

ASJC Scopus subject areas

Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1080/03155986.2001.11732439

Cite this

@article{d6ef9e6b87dd4155a6f3d904e6f97071,

title = "Job shop scheduling with two jobs and nonregular objective functions",

abstract = "We consider the job shop scheduling problem with two jobs. We consider a broad class of non-regular, quasi-convex functions of the completion time of the two jobs. We show that the optimal solution, for this class of objective functions, can be computed in O(r log r + log H) time, where r is the number of operation pairs using the same machine, and H is the maximum operation processing time.",

author = "A. Agnetis and Mirchandani, {P. B.} and D. Pacciarelli and A. Pacifici",

year = "2001",

month = aug,

doi = "10.1080/03155986.2001.11732439",

language = "English (US)",

volume = "39",

pages = "227--244",

journal = "INFOR",

issn = "0315-5986",

publisher = "University of Toronto Press",

number = "3",

}

TY - JOUR

T1 - Job shop scheduling with two jobs and nonregular objective functions

AU - Agnetis, A.

AU - Mirchandani, P. B.

AU - Pacciarelli, D.

AU - Pacifici, A.

PY - 2001/8

Y1 - 2001/8

N2 - We consider the job shop scheduling problem with two jobs. We consider a broad class of non-regular, quasi-convex functions of the completion time of the two jobs. We show that the optimal solution, for this class of objective functions, can be computed in O(r log r + log H) time, where r is the number of operation pairs using the same machine, and H is the maximum operation processing time.

AB - We consider the job shop scheduling problem with two jobs. We consider a broad class of non-regular, quasi-convex functions of the completion time of the two jobs. We show that the optimal solution, for this class of objective functions, can be computed in O(r log r + log H) time, where r is the number of operation pairs using the same machine, and H is the maximum operation processing time.

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

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

U2 - 10.1080/03155986.2001.11732439

DO - 10.1080/03155986.2001.11732439

M3 - Article

AN - SCOPUS:0035418182

SN - 0315-5986

VL - 39

SP - 227

EP - 244

JO - INFOR

JF - INFOR

IS - 3

ER -

Job shop scheduling with two jobs and nonregular objective functions

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this