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.
Titolo: | Scheduling with job-rejection and position-dependent processing times on proportionate flowshops |
Autori: | |
Rivista: | |
Citazione: | Agnetis, A., & Mosheiov, G. (2017). Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. OPTIMIZATION LETTERS, 11(4), 885-892. |
Anno: | 2017 |
Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
Scheduling with job-rejection and position-dependent processing times on proportionate flowshops.pdf | articolo completo | PDF editoriale | NON PUBBLICO - Accesso privato/ristretto | Administrator Richiedi una copia |
Utilizza questo identificativo per citare o creare un link a questo documento:
http://hdl.handle.net/11365/1006788
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.