Integrated Production Scheduling and Distribution Planning with Time Windows

Saadettin Erhan Kesen () and Tolga Bektaş ()
Additional contact information
Saadettin Erhan Kesen: Konya Technical University
Tolga Bektaş: Centre for Operational Research, Management Science and Information Systems (CORMSIS), Southampton Business School, University of Southampton

A chapter in Lean and Green Supply Chain Management, 2019, pp 231-252 from Springer

Abstract: 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.

Keywords: Parallel machines; Scheduling; Vehicle routing problem; Time windows (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-319-97511-5_8

Ordering information: This item can be ordered from
http://www.springer.com/9783319975115

DOI: 10.1007/978-3-319-97511-5_8

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().