Some local search algorithms for no-wait flow-shop problem with makespan criterion

Grabowski, J.; Pempera, Jarosław

doi:10.1016/j.cor.2004.02.009

Cited by 150 publications

(74 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Gangadharan and Rajendran (1993) and Rajendran (1994) have developed constructive heuristics which perform better than the heuristics presented by Bonney and Gundry (1976) and King and Spachis (1980). Recently, some constructive heuristics are reported by Grabowski and Pempera (2005), , and Laha and Chakraborty (2009). Regarding metaheuristics, applications by Genetic Algorithms can be seen in Aldowaisan and Allahverdi (2003), Chaudhry and Khan (2012), Samarghandy and Elmekkawy (2012) and Ying et al (2012).…”

Section: Introductionmentioning

confidence: 99%

A High Quality Solution Constructive Heuristic for No-Wait Flow Shop Scheduling Problem

Nagano¹,

Miyata²

2016

Industrial Engineering and Management Systems

View full text Add to dashboard Cite

This paper deals with the no-wait flow shop scheduling problem in order to minimize the total time to complete the schedule or makespan. It is introduced a constructive heuristic which builds the production schedule from job partial sequences by using an appropriate mechanism of insertion. An extensive computational experiment has been performed to evaluate the performance of proposed heuristic. Experimental results have clearly shown that the presented heuristic provides better solutions than those from the best heuristics existing.

show abstract

Section: Introductionmentioning

confidence: 99%

A High Quality Solution Constructive Heuristic for No-Wait Flow Shop Scheduling Problem

Nagano¹,

Miyata²

2016

Industrial Engineering and Management Systems

View full text Add to dashboard Cite

show abstract

“…Different genetic algorithms (GA) are applied by Chen and Neppalli [20], Aldowaisan and Allahverdi [21]. Among the other metaheuristics, one could refer the reader to particle swarm optimization (PSO) by Pan et al [22], simulated annealing (SA) by Fink and Voß [23], ant colony optimization (ACO) by Shyu et al [24] and tabu search (TS) by Grabowski and Pempera [25]. Khalili [26] proposed an iterated local search algorithm for flexible flow lines with sequence dependent setup times to minimize total weighted completion and also studied multiobjective no-wait hybrid flowshop scheduling problems to minimise both makespan and total tardiness [27].…”

Section: Literature Reviewmentioning

confidence: 99%

An electromagnetism-inspired method for a generalized flowshop problem

Khalili

2014

Manufacturing Rev.

View full text Add to dashboard Cite

-There are two common simplifying assumptions made in the scheduling of operations. One is that machines are available continuously, and the other is that once a job completes one process it is immediately available for its next. Moreover, in flowshops, it is commonly assumed that jobs must visit all machines. In practice, however, these assumptions may not be justifiable in some applications. This paper deals with a generalized flow shop (GFS) problem with machine availability constraints, transportation times between stages, and machine skipping. The electromagnetism-like method (EM) has been successfully applied to some NP-hard problems and this has motivated us to apply and assess the effectiveness of an EM algorithm in the GFS scenarios. Simulated annealing (SA) and a number of other well-recognized heuristics to the given GFS scheduling problem that minimizes two independent objective functions, namely the total tardiness and the total completion time also has been applied. In order to evaluate the performance of the proposed EM and SA, a set of practical instances has been considered. The related results are analyzed in two parts; in term of the objective functions, and the observed effects on variables in our instances. Extensive experiments and statistical analyses demonstrate that our proposed EM is more efficient than SA and other heuristics with regards to the objective functions considered in this paper.

show abstract

“…Aldowaisan and Allahverdi (2003) presented new heuristics, which were shown to outperform those of Gangadharan and Rajendran (1993) and Rajendran (1994). More recently, Grabowski and Pempera (2005) have presented complex local search algorithms for the same problem based on tabu search methods. Additionally, and as it is well known, the max / / Fm no wait C problem can be transformed into a Traveling Salesman Problem (TSP) (see for example Bagchi, Gupta and Sriskandarajah (2006)) and therefore, all the existing TSP literature also applies.…”

Section: Introductionmentioning

confidence: 99%

New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness

Ruíz

Allahverdi

2009

International Journal of Production Research

View full text Add to dashboard Cite

Some local search algorithms for no-wait flow-shop problem with makespan criterion

Cited by 150 publications

References 24 publications

A High Quality Solution Constructive Heuristic for No-Wait Flow Shop Scheduling Problem

A High Quality Solution Constructive Heuristic for No-Wait Flow Shop Scheduling Problem

An electromagnetism-inspired method for a generalized flowshop problem

New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness

Contact Info

Product

Resources

About