A critical issue in supply chain management is coordinating the decisions made by decision makers at different stages, for example a supplier and one or several manufacturers. We model this issue by assuming that both the supplier and each manufacturer have an ideal schedule, determined by their own costs and constraints. An interchange cost is incurred by the supplier or a manufacturer whenever the relative order of two jobs in its actual schedule is different from that in its ideal schedule. An intermediate storage buffer is available to resequence the jobs between the two stages.We consider the problems of finding an optimal supplier’s schedule, an optimal manufacturer’s schedule, and optimal schedules for both. The objective functions we consider are the minimization of total interchange cost, and of total interchange plus buffer storage cost. We describe efficient algorithms for all the supplier’s and manufacturers’ problems, as well as for a special case of the joint scheduling problem. The running time of these algorithms is polynomial in both the number of jobs and the number of manufacturers. Finally, we identify conditions under which cooperation between the supplier and a manufacturer reduces their total cost.

Agnetis, A., HALL N., G., & Pacciarelli, D. (2006). Supply chain scheduling: sequence coordination. DISCRETE APPLIED MATHEMATICS, 154, 2044-2063.

Supply chain scheduling: sequence coordination

AGNETIS, ALESSANDRO;
2006

Abstract

A critical issue in supply chain management is coordinating the decisions made by decision makers at different stages, for example a supplier and one or several manufacturers. We model this issue by assuming that both the supplier and each manufacturer have an ideal schedule, determined by their own costs and constraints. An interchange cost is incurred by the supplier or a manufacturer whenever the relative order of two jobs in its actual schedule is different from that in its ideal schedule. An intermediate storage buffer is available to resequence the jobs between the two stages.We consider the problems of finding an optimal supplier’s schedule, an optimal manufacturer’s schedule, and optimal schedules for both. The objective functions we consider are the minimization of total interchange cost, and of total interchange plus buffer storage cost. We describe efficient algorithms for all the supplier’s and manufacturers’ problems, as well as for a special case of the joint scheduling problem. The running time of these algorithms is polynomial in both the number of jobs and the number of manufacturers. Finally, we identify conditions under which cooperation between the supplier and a manufacturer reduces their total cost.
Agnetis, A., HALL N., G., & Pacciarelli, D. (2006). Supply chain scheduling: sequence coordination. DISCRETE APPLIED MATHEMATICS, 154, 2044-2063.
File in questo prodotto:
File Dimensione Formato  
supply chain scheduling sequence coordination.pdf

non disponibili

Tipologia: Post-print
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 289.96 kB
Formato Adobe PDF
289.96 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
TOP CITED ARTICLE.pdf

non disponibili

Tipologia: Altro materiale allegato
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 64.15 kB
Formato Adobe PDF
64.15 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: http://hdl.handle.net/11365/24217
 Attenzione

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