We study the classical scheduling problem of minimizing makespan on a proportionate flowshop. Position-dependent job processing times in the most general way are considered. We introduce a polynomial time solution procedure which is more efficient than the one known in the literature. The problem is further extended to allow job-rejection. This more general version is shown to be solved in polynomial time as well.
Agnetis, A., Mosheiov, G. (2017). Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. OPTIMIZATION LETTERS, 11(4), 885-892 [10.1007/s11590-016-1059-8].
Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
Agnetis, Alessandro;
2017-01-01
Abstract
We study the classical scheduling problem of minimizing makespan on a proportionate flowshop. Position-dependent job processing times in the most general way are considered. We introduce a polynomial time solution procedure which is more efficient than the one known in the literature. The problem is further extended to allow job-rejection. This more general version is shown to be solved in polynomial time as well.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
Scheduling with job-rejection and position-dependent processing times on proportionate flowshops.pdf
non disponibili
Descrizione: articolo completo
Tipologia:
PDF editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
566.88 kB
Formato
Adobe PDF
|
566.88 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
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/1006788