Coordinated production and delivery scheduling for service-oriented manufacturing systems with deterioration effect

Service-oriented manufacturing (SOM) is a new industrial model that combines manufacturing with service. To enhance the competitiveness of manufacturers in SOM systems, we investigate a coordinated production and delivery scheduling problem considering a third-party logistics (3PL) provider. The con...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production research Vol. 62; no. 20; pp. 7598 - 7617
Main Authors: Zhao, Ting, Lu, Shaojun, Cheng, Hao, Ren, Mingyu, Liu, Xinbao
Format: Journal Article
Language:English
Published: London Taylor & Francis 17.10.2024
Taylor & Francis LLC
Subjects:
Algorithms
Coordinated scheduling
Deliveries
Delivery scheduling
deterioration effect
Dynamic programming
dynamic programming algorithm
Freight forwarding
general variable neighbourhood search
heuristic algorithm
Heuristic methods
Logistics management
Manufacturers
Manufacturing
Production scheduling
Search methods
third-party logistics
ISSN:0020-7543, 1366-588X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Service-oriented manufacturing (SOM) is a new industrial model that combines manufacturing with service. To enhance the competitiveness of manufacturers in SOM systems, we investigate a coordinated production and delivery scheduling problem considering a third-party logistics (3PL) provider. The considered problem can be divided into two phases, including production phase and delivery phase. In the production phase, jobs are processed by multiple manufacturers located in different geographical zones. Jobs are with deteriorating processing time and set-up time. Several structural properties of the problem in the production phase are proposed, based on which a heuristic algorithm is designed to make decisions on job batching and batch sequencing. After being processed, the finished jobs are immediately delivered to a customer by manufacturers' own vehicles or the 3PL provider. A dynamic programming algorithm is developed to solve the problem in the delivery phase. The integrated scheduling problem is proved to be NP-hard. Hence, we develop a general variable neighbourhood search (GVNS) to solve the problem in a reasonable time. The basic variable neighbourhood descent (BVND) is used as a local search method in the GVNS. Finally, the computational experiments are conducted and the results verify the effectiveness and stability of the proposed approach.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2023.2217284