DocumentCode
176518
Title
Coordinative scheduling problem of single machine manufacturing and delivery with due date windows
Author
Pang Hali
Author_Institution
Coll. of Inf. Sci. & Technol., Northeastern Univ., Shenyang, China
fYear
2014
fDate
May 31 2014-June 2 2014
Firstpage
3229
Lastpage
3234
Abstract
Considering capacity of transportation measured by space and delivery route constraints, a coordinative scheduling problem of single machine manufacturing and multiple customer delivery with due date windows was studied in this paper. A bi-level mathematic programming model was presented, and a PSO algorithm is proposed to solve the problem. Some computing tests were performed to compare the different algorithm strategies.
Keywords
goods distribution; mathematical programming; particle swarm optimisation; single machine scheduling; transportation; PSO algorithm; bilevel mathematic programming model; coordinative scheduling problem; delivery route constraint; due date windows; multiple customer delivery; single machine manufacturing; space constraint; transportation capacity; Job shop scheduling; Manufacturing; Mathematical model; Single machine scheduling; Supply chains; Vehicles; Coordinative scheduling; Due date window; Manufacturing and delivery; PSO algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Control and Decision Conference (2014 CCDC), The 26th Chinese
Conference_Location
Changsha
Print_ISBN
978-1-4799-3707-3
Type
conf
DOI
10.1109/CCDC.2014.6852731
Filename
6852731
Link To Document