IRIS

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.

Agnetis, A., Mirchandani, P.B., Pacciarelli, D., Pacifici, A. (2001). Job Shop Scheduling with Two Jobs and Nonregular Objective Functions. INFOR, 39(3), 227-244 [10.1080/03155986.2001.11732439].

Job Shop Scheduling with Two Jobs and Nonregular Objective Functions

Agnetis, Alessandro;
2001-01-01

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.
2001
INFOR
Agnetis, A., Mirchandani, P.B., Pacciarelli, D., Pacifici, A. (2001). Job Shop Scheduling with Two Jobs and Nonregular Objective Functions. INFOR, 39(3), 227-244 [10.1080/03155986.2001.11732439].
1.1 Articolo in rivista
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11365/7737
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo