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: Information Systems and Operational Research
JF - INFOR: Information Systems and Operational Research
IS - 3
ER -