Multiproduct batching and scheduling with buffered rework: The case of a car paint shop. (1st August 2014)

• Record Type: Journal Article
• Authors: Jaehn, Florian; Kovalev, Sergey; Kovalyov, Mikhail Y.; Pesch, Erwin
• Is Part Of: Naval research logistics. Volume 61:Number 6(2014:Sep.)
• Page Start: 458
• Page End: 471
• Publication Date: 2014-08-01
• Subjects: Logistics, Naval -- Periodicals; Supplies and stores -- Periodicals; 359.07
• DOI: 10.1002/nav.21596
• Languages: English
• ISSNs: 0894-069X

Abstract

<abstract abstract-type="main"> <title>Abstract</title> <p>We study a problem of scheduling products on the same facility, which is motivated by a car paint shop. Items of the same product are identical. Operations on the items are performed sequentially in batches, where each batch is a set of operations on the same product. Some of the produced items are of the required good quality and some items can be defective. Defectiveness of an item is determined by a given simulated function of its product, its preceding product, and the position of its operation in the batch. Defective items are kept in a buffer of a limited capacity, and they are then remanufactured at the same facility. A minimum waiting time exists for any defective item before its remanufacturing can commence. Each product has a sequence independent setup time which precedes its first operation or its operation following an operation of another product. A due date is given for each product such that all items of the same product have the same due date and the objective is to find a schedule which minimizes maximum lateness of product completion times with respect to their due dates. The problem is proved NP‐hard in the strong sense, and a heuristic Group Technology (GT) solution approach is suggested and analyzed. The results justify application of the GT approach to scheduling real car paint shops with buffered rework. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 458–471, 2014</p> </abstract>