In this paper, we address a model for supply chain coordination. There are m manufacturers modelled as single machines, each of which processes a specific set of jobs (products). After processing is completed, jobs are batched, and batches are shipped to a customer by means of vehicles. The problem consists in concurrently finding a production schedule of the jobs, a partition of jobs into delivery batches and an assignment of delivery batches to vehicles, so that jobs are delivered within their deadlines and total costs are minimised. We focus on a scenario characterised by fixed departure times and inventory holding costs. For each departure time there is a given number of vehicles, possibly having limited capacity. Each job incurs a cost proportional to the time from job completion to delivery departure. In this paper, we show that the problem is NP-hard even for a very restricted case, and report various polynomiality results for two scenarios, namely: (i) when the production sequence of each manufacturer is fixed in advance, and (ii) when there is a single manufacturer and processing times are all equal to 1. We also point out several open problems.

Agnetis, A., Aloulou, M.A., & Kovalyov, M.Y. (2017). Integrated production scheduling and batch delivery with fixed departure times and inventory holding costs. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 55(20), 6193-6206 [10.1080/00207543.2017.1346323].

Integrated production scheduling and batch delivery with fixed departure times and inventory holding costs

Agnetis, Alessandro
;
2017

Abstract

In this paper, we address a model for supply chain coordination. There are m manufacturers modelled as single machines, each of which processes a specific set of jobs (products). After processing is completed, jobs are batched, and batches are shipped to a customer by means of vehicles. The problem consists in concurrently finding a production schedule of the jobs, a partition of jobs into delivery batches and an assignment of delivery batches to vehicles, so that jobs are delivered within their deadlines and total costs are minimised. We focus on a scenario characterised by fixed departure times and inventory holding costs. For each departure time there is a given number of vehicles, possibly having limited capacity. Each job incurs a cost proportional to the time from job completion to delivery departure. In this paper, we show that the problem is NP-hard even for a very restricted case, and report various polynomiality results for two scenarios, namely: (i) when the production sequence of each manufacturer is fixed in advance, and (ii) when there is a single manufacturer and processing times are all equal to 1. We also point out several open problems.
Agnetis, A., Aloulou, M.A., & Kovalyov, M.Y. (2017). Integrated production scheduling and batch delivery with fixed departure times and inventory holding costs. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 55(20), 6193-6206 [10.1080/00207543.2017.1346323].
File in questo prodotto:
File Dimensione Formato  
Integrated production scheduling and batch delivery with fixed departure times and inventory holding costs.pdf

non disponibili

Tipologia: PDF editoriale
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 545.12 kB
Formato Adobe PDF
545.12 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/1033511