The University of Southampton
University of Southampton Institutional Repository

Integrated production scheduling and distribution planning with time windows

Integrated production scheduling and distribution planning with time windows
Integrated production scheduling and distribution planning with time windows

Ensuring timely product deliveries in supply chains depends on the decisions made at various stages of the supply chain, including the production stage where commodities are made available, and the distribution stage where shipments are made to customers within requested time windows. Delivery times depend on the distribution plans, which are inherently linked to the production schedules, as a commodity must first be produced or procured before being sent onwards in the supply chain. One way to ensure that the delivery times are respected is to perform direct shipments, but this is often costly. In contrast, products can be consolidated whereby several customers are visited on a given vehicle route, but this may result in either early or late deliveries. The challenge is then to devise lean production and distribution schedules that eliminate any redundancy in delivery times. In this chapter, we present an integrated production and outbound distribution scheduling problem with time windows arising in a supply chain. The problem involves jointly deciding on production and distribution operations where a manufacturer is committed first to processing a given set of orders and then to distributing them to the respective customers in different locations. The orders first undergo single processing through a set of identical parallel machines. Once completed, they are delivered by a fleet of vehicles in such a way so as to meet the customer time windows. The objective is to improve the timeliness of the deliveries, which is achieved by minimizing the earliness or tardiness of each order in reaching the customer. The chapter formally introduces the problem, describes integer linear programming formulations for two variants of the problem, and presents computational results on solving randomly generated instances with the proposed formulations.

Parallel machines, Scheduling, Time windows, Vehicle routing problem
0884-8289
231-252
Springer
Kesen, Saadettin Erhan
cc95c51c-add3-43f0-8412-150c5262b5b8
Bektaş, Tolga
0db10084-e51c-41e5-a3c6-417e0d08dac9
Paksoy, T.
Weber, G.W.
Huber, S.
Kesen, Saadettin Erhan
cc95c51c-add3-43f0-8412-150c5262b5b8
Bektaş, Tolga
0db10084-e51c-41e5-a3c6-417e0d08dac9
Paksoy, T.
Weber, G.W.
Huber, S.

Kesen, Saadettin Erhan and Bektaş, Tolga (2019) Integrated production scheduling and distribution planning with time windows. In, Paksoy, T., Weber, G.W. and Huber, S. (eds.) Lean and Green Supply Chain Management. (International Series in Operations Research and Management Science, , (doi:10.1007/978-3-319-97511-5_8), 273) Cham. Springer, pp. 231-252. (doi:10.1007/978-3-319-97511-5_8).

Record type: Book Section

Abstract

Ensuring timely product deliveries in supply chains depends on the decisions made at various stages of the supply chain, including the production stage where commodities are made available, and the distribution stage where shipments are made to customers within requested time windows. Delivery times depend on the distribution plans, which are inherently linked to the production schedules, as a commodity must first be produced or procured before being sent onwards in the supply chain. One way to ensure that the delivery times are respected is to perform direct shipments, but this is often costly. In contrast, products can be consolidated whereby several customers are visited on a given vehicle route, but this may result in either early or late deliveries. The challenge is then to devise lean production and distribution schedules that eliminate any redundancy in delivery times. In this chapter, we present an integrated production and outbound distribution scheduling problem with time windows arising in a supply chain. The problem involves jointly deciding on production and distribution operations where a manufacturer is committed first to processing a given set of orders and then to distributing them to the respective customers in different locations. The orders first undergo single processing through a set of identical parallel machines. Once completed, they are delivered by a fleet of vehicles in such a way so as to meet the customer time windows. The objective is to improve the timeliness of the deliveries, which is achieved by minimizing the earliness or tardiness of each order in reaching the customer. The chapter formally introduces the problem, describes integer linear programming formulations for two variants of the problem, and presents computational results on solving randomly generated instances with the proposed formulations.

Full text not available from this repository.

More information

e-pub ahead of print date: 12 November 2018
Published date: 2019
Keywords: Parallel machines, Scheduling, Time windows, Vehicle routing problem

Identifiers

Local EPrints ID: 426655
URI: https://eprints.soton.ac.uk/id/eprint/426655
ISSN: 0884-8289
PURE UUID: 248d2b61-8317-4be3-b411-a4fe78ed21e7
ORCID for Tolga Bektaş: ORCID iD orcid.org/0000-0003-0634-144X

Catalogue record

Date deposited: 07 Dec 2018 18:16
Last modified: 14 Mar 2019 01:39

Export record

Altmetrics

Contributors

Author: Saadettin Erhan Kesen
Author: Tolga Bektaş ORCID iD
Editor: T. Paksoy
Editor: G.W. Weber
Editor: S. Huber

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×