zbMATH — the first resource for mathematics

Batch scheduling of deteriorating reworkables. (English) Zbl 1146.90026
Summary: 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.

90B35 Deterministic scheduling theory in operations research
Full Text: DOI
[1] Flapper, S.D.P.; Fransoo, J.C.; Broekmeulen, R.A.C.M.; Inderfurth, K., Planning and control of rework in the process industries: A review, Production planning & control, 1, 26-34, (2002)
[2] Gitlow, H.; Gitlow, S.; Oppenheim, A.; Oppenheim, R., Tools and methods for the improvement of quality, (1989), Irwin Boston · Zbl 0713.62102
[3] Gordon, V.S.; Kubiak, W., Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs, Information processing letters, 68, 153-159, (1998) · Zbl 1337.90026
[4] Goyal, S.K.; Giri, B.C., Recent trends in modeling of deteriorating inventory, European journal of operational research, 134, 1-16, (2001) · Zbl 0978.90004
[5] Hall, N.G.; Sethi, S.P.; Sriskandarajah, C., On the complexity of generalized due date scheduling problems, European journal of operational research, 51, 100-109, (1991) · Zbl 0742.90043
[6] Inderfurth, K.; Kovalyov, M.Y.; Ng, C.T.; Werner, F., Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables, International journal of production economics, 105, 345-356, (2007)
[7] K. Inderfurth, G. Lindner, N.P. Rahaniotis, Lotsizing in a production system with rework and product deterioration, Preprint 1/2003, Faculty of Economics and Management, Otto-von-Guericke-University Magdeburg, Germany, 2003. · Zbl 1157.90314
[8] Potts, C.N.; Kovalyov, M.Y., Scheduling with batching: A review, European journal of operations research, 120, 228-249, (2000) · Zbl 0953.90028
[9] Qi, X.T.; Yu, G.; Bard, J.F., Single machine scheduling with assignable due dates, Discrete applied mathematics, 122, 211-233, (2002) · Zbl 1019.90024
[10] Tanaka, K.; Vlach, M., Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine, Annals of operations research, 86, 507-526, (1999) · Zbl 0922.90092
[11] Teunter, R.H.; Flapper, S.D.P., Lot-sizing for a single-stage single-product production system with rework of perishable production defectives, OR spectrum, 25, 85-96, (2003) · Zbl 1040.90012
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.