openHSU logo
Log In(current)
  1. Home
  2. Helmut-Schmidt-University / University of the Federal Armed Forces Hamburg
  3. Publications
  4. 3 - Publication references (without full text)
  5. Multiproduct batching and scheduling with buffered rework

Multiproduct batching and scheduling with buffered rework

The case of a car paint shop
Publication date
2014-08-01
Document type
Forschungsartikel
Author
Jaehn, Florian  
Kovalev, Sergey
Kovalyov, Mikhail Y.
Pesch, Erwin
Organisational unit
University of Augsburg, Institute of Sustainable Operations and Logistics
DOI
10.1002/nav.21596
URI
https://openhsu.ub.hsu-hh.de/handle/10.24405/22386
Scopus ID
2-s2.0-84905982688
Publisher
Wiley
Series or journal
Naval Research Logistics
ISSN
0894-069X
Periodical volume
61
Periodical issue
6
First page
458
Last page
471
Part of the university bibliography
Nein
Additional Information
Language
English
Keyword
Batching
Car painting
Group technology
Production
Rework
Scheduling
Abstract
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.
Cite as
Jaehn, F., Kovalev, S., Kovalyov, M.Y. and Pesch, E. (2014), Multiproduct batching and scheduling with buffered rework: The case of a car paint shop. Naval Research Logistics, 61: 458-471. https://doi.org/10.1002/nav.21596
Version
Published version
Access right on openHSU
Metadata only access

  • Privacy policy
  • Send Feedback
  • Imprint