Time-dependent formulations for minimizing total completion time in a parallel machine scheduling problem with dependent setup times. Issue 12 (2016)

• Record Type: Journal Article
• Authors: Baez, Sarahi; Angel-Bello, Francisco; Alvarez, Ada
• Is Part Of: IFAC-PapersOnLine. Volume 49:Issue 12(2016)
• Page Start: 857
• Page End: 862
• Publication Date: 2016
• Subjects: Time-dependent formulations -- Parallel machine scheduling -- Total completion time -- Dependent setup time; Automatic control -- Periodicals; 629.805
• DOI: 10.1016/j.ifacol.2016.07.882
• Languages: English
• ISSNs: 2405-8963

Abstract

Abstract: In this work two formulations for minimizing the total completion time a parallel machine scheduling problem with dependent set up times are proposed. They are developed from formulations for the same problem for a single machine environment and showed have a better performance than a formulation based on m-Traveling Salesmen Problem, consuming less computational time on instances of the same size and allow solving to optimality more than five times larger data instances.