Please use this identifier to cite or link to this item:
|Title:||Batch scheduling of deteriorating reworkables|
|Authors:||Barketau, M. S.|
Cheng, T. C. Edwin
Kovalyov, Mikhail Y.
|Source:||European journal of operational research, 16 Sept. 2008, v. 189, no. 3, p. 1317-1326.|
|Abstract:||The problem of scheduling the production of new and recoverable defective items of the same product manufactured on the same facility is studied. Items are processed in batches. Each batch comprises two sub-batches processed consecutively. In the first sub-batch, all the items are newly manufactured. Some of them are of the required good quality and some are defective. The defective items are remanufactured in the second sub-batch. They deteriorate while waiting for rework. This results in increased time and cost for their remanufacturing. All the items in the same sub-batch complete at the same time, which is the completion time of the last item in the sub-batch. Each remanufactured defective item is of the required good quality. It is assumed that the percentage of defective items in each batch is the same. A setup time is required to start batch processing and to switch from manufacturing to remanufacturing. The demands for good quality items over time are given. The objective is to find batch sizes such that the total setup and inventory holding cost is minimized and all the demands are satisfied. Dynamic programming algorithms are presented for the general problem and some important special cases.|
|Rights:||European Journal of Operational Research © 2007 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.|
|Appears in Collections:||LMS Journal/Magazine Articles|
Files in This Item:
|BarkChengKov_EJOR_PMS04_rev_2.pdf||Pre-published version||167.92 kB||Adobe PDF||View/Open|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.