NEW HEURISTICS FOR THE NO-WAIT FLOWSHOP WITH SEQUENCE-DEPENDENT SETUP TIMES PROBLEM
In this paper, we address the problem of scheduling jobs in a no-wait flowshop with sequence-dependent setup times with the objective of minimizing the makespan and the total flowtime. As this problem is well-known for being NP-hard, we present two new constructive heuristics in order to obtain good approximate solutions for the problem in a short CPU time, named GAPH and QUARTS. GAPH is based on a structural property for minimizing makespan and QUARTS breaks the problem in quartets in order to minimize the total flowtime. Experimental results demonstrate the superiority of the proposed approachs over three of the best-know methods in the literature: BAH and BIH, from Bianco, Dell´Olmo and Giordani (1999) and TRIPS, by Brown, McGarvey and Ventura (2004).
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors must have a written permission from any third-party materials used in the article, such as figures and graphics. The permission must explicitly allow authors to use the materials. The permission should be submitted with the article, as a supplementary file.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) after BJO&PM publishes it (See The Effect of Open Access).