Manufacture and Delivery Scheduling for Multiple Customers on a Single Machine with Availability Constraint
- Jing Fan
- Corresponding Author
- Jing Fan
Available Online November 2016.
- https://doi.org/10.2991/iwama-16.2016.51How to use a DOI?
- Manufacture; Delivery; Scheduling; Multiple Customers; Dynamic Programming Algorithm
- In this paper we consider a scheduling problem with the joint consideration of manufacture and delivery for multiple customers. Since the machine is not always available due to breakdown or maintenance during the manufacture period, the interrupted job is resumable after the machine becomes available again. In the delivery period, amounts of vehicles with fixed load capacities deliver completed jobs in batches to K customers. Only jobs belonging to the same customer can be delivered together in the same shipment. The cost of each delivery for different customer is different. 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(nK+2) , where n is the number of jobs. The performance of an instance is shown the effectiveness of the algorithm.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Jing Fan PY - 2016/11 DA - 2016/11 TI - Manufacture and Delivery Scheduling for Multiple Customers on a Single Machine with Availability Constraint BT - 6th International Workshop of Advanced Manufacturing and Automation PB - Atlantis Press SN - 2352-5428 UR - https://doi.org/10.2991/iwama-16.2016.51 DO - https://doi.org/10.2991/iwama-16.2016.51 ID - Fan2016/11 ER -