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., Pacciarelli, D., Pacifici, A. (2001). Job shop scheduling with two jobs and nonregular objective functions. INFOR, 39(3), 227-244.

Job shop scheduling with two jobs and nonregular objective functions

PACIFICI, ANDREA
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
Pubblicato
Rilevanza internazionale
Articolo
Esperti anonimi
Settore MAT/09 - RICERCA OPERATIVA
English
Agnetis, A., Mirchandani, P., Pacciarelli, D., Pacifici, A. (2001). Job shop scheduling with two jobs and nonregular objective functions. INFOR, 39(3), 227-244.
Agnetis, A; Mirchandani, P; Pacciarelli, D; Pacifici, A
Articolo su rivista
File in questo prodotto:
File Dimensione Formato  
INFOR01.pdf

accesso aperto

Descrizione: Articolo principale
Dimensione 1.03 MB
Formato Adobe PDF
1.03 MB Adobe PDF Visualizza/Apri

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/2108/49497
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 2
social impact