Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/286997 
Year of Publication: 
2021
Citation: 
[Journal:] Journal of Scheduling [ISSN:] 1099-1425 [Volume:] 25 [Issue:] 1 [Publisher:] Springer US [Place:] New York, NY [Year:] 2021 [Pages:] 125-137
Publisher: 
Springer US, New York, NY
Abstract: 
Single machine scheduling with sequence-dependent setup times is one of the classical problems of production planning with widespread applications in many industries. Solving this problem under the min-makespan objective is well known to be strongly NP-hard. We consider a special case of the problem arising from products having a modular design. This means that product characteristics, (mass-)customizable by customers, are realized by separate components that can freely be combined. If consecutive products differ by a component, then a setup is necessary. This results in a specially structured setup matrix that depends on the similarities of product characteristics. We differentiate alternative problem cases where, for instance, the setup operations for multiple components either have to be executed sequentially or are allowed to be conducted in parallel. We analyze the computational complexity of various problem settings. Our findings reveal some special cases that are solvable in polynomial time, whereas most problem settings are shown to remain strongly NP-hard.
Subjects: 
Scheduling
Modular products
Sequence-dependent setups
Complexity
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.