Autor: |
Prasetyaningsih, Endang, Suprayogi, Samadhi, T. M. A. Ari, Halim, Abdul Hakim |
Předmět: |
|
Zdroj: |
Proceedings of the International Conference on Industrial Engineering & Operations Management; 2014, p2109-2117, 9p |
Abstrakt: |
This paper considers a batch scheduling problem of a JIT supplier and integrates production and delivery decisions. Parts that have been sequenced are to be processed on a single machine, collected in a container, and sent to a customer in order to be received at a common due date. Scheduling involves the number of batches, batch sizes, scheduling of the resulting batches, and the number of vehicles delivering the batches. The objective is to minimize inventory costs wherein the holding costs of in-process parts and completed parts are distinguished. The holding cost is derived from the so-called actual flow time, defined as an interval time of parts spent in the shop since the starting time for processing a batch until its due date. The proposed problem is formulated as a non-linier programming solved by relaxing the variable of the number of batches to be a parameter. An algorithm is proposed to solve the model and tested by numerical experiences. This research shows that there is a ratio between in-process parts and completed parts holding costs which affects the decision of the number of batches and their sizes. In addition, this research shows that the lower the in-process parts holding cost, the more advantageously to store parts as WIP than as finished product, and vise versa. The number of vehicles is determined from the number of the resulting batches. [ABSTRACT FROM AUTHOR] |
Databáze: |
Complementary Index |
Externí odkaz: |
|