Open AccessManufacture and delivery scheduling for customers on one manufacturing machine with an availability constraint
Author(s) -
Jiulun Fan
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1237/4/042014
Subject(s) - scheduling (production processes) , computer science , job shop scheduling , constraint (computer aided design) , mathematical optimization , constraint programming , dynamic programming , total cost , operations research , operations management , business , mathematics , engineering , algorithm , operating system , stochastic programming , schedule , geometry , accounting
We consider a scheduling problem with the joint consideration of manufacture and delivery for m customers in different locations. In the manufacture period, there must be some interrupted job because of the arranged maintenance of the machine, and that job can be resumable when the machine becomes available again. In the delivery period, amounts of vehicles without limits of load capacity deliver completed jobs belonging to the same customer to customers in batches. The cost of each delivery is proportional to the distance between the customer and the manufacturer. Our goal is to minimize the sum of total departure time and total delivery cost. The problem is solved optimally by a dynamic programming algorithm with polynomial time O ( m 2 n 4 ), where n is the number of all jobs.