Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/78579 
Year of Publication: 
2012
Citation: 
[Journal:] Journal of Industrial Engineering International [ISSN:] 2251-712X [Volume:] 8 [Publisher:] Springer [Place:] Heidelberg [Year:] 2012 [Pages:] 1-8
Publisher: 
Springer, Heidelberg
Abstract: 
This paper considers open-shop scheduling with no intermediate buffer to minimize total tardiness. This problem occurs in many production settings, in the plastic molding, chemical, and food processing industries. The paper mathematically formulates the problem by a mixed integer linear program. The problem can be optimally solved by the model. The paper also develops a novel metaheuristic based on an electromagnetism algorithm to solve the large-sized problems. The paper conducts two computational experiments. The first includes small-sized instances by which the mathematical model and general performance of the proposed metaheuristic are evaluated. The second evaluates the metaheuristic for its performance to solve some large-sized instances. The results show that the model and algorithm are effective to deal with the problem.
Subjects: 
scheduling
open shop with no buffer
mixed integer linear programming
electromagnetism algorithm
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article

Files in This Item:
File
Size
824.66 kB





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