A genetic algorithm for flowshop sequencing

Reeves, Colin R.

doi:10.1016/0305-0548(93)e0014-k

Cited by 756 publications

(347 citation statements)

References 9 publications

Supporting

Mentioning

331

Contrasting

Unclassified

Order By: Relevance

“…Gourgand et al [13] and Zhang and Wu [14] presented several simulated annealing (SA)-based algorithms for the FS problem. A genetic algorithm has been widely used in many previous works for the FS makespan problem, see e.g., Reeves [15].…”

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

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

show abstract

“…This type of representation is also called as non-linear encoding. This natural representation of the problem has been frequently used by researchers (Reeves, 1995;Chen et al, 1995;Murata et al, 1996). In other words, the string used in this genetic algorithm is a permutation of given jobs.…”

Section: Hybrid Gamentioning

confidence: 99%

“…Hence, subsequent populations were seeded with the best solution found in the previous runs. The remaining members of the population were generated randomly (Reeves, 1995).…”

Section: Hybrid Gamentioning

confidence: 99%

A hybrid genetic algorithm for a complex cost function for flowshop scheduling problem

Bhowmick¹,

Maniyan²,

Saxena³

et al. 2011

IJET

View full text Add to dashboard Cite

Abstract:Supply chain excellence has a real impact on business strategy. Manufacturing is an integral part of this strategy represents one of the most exciting opportunities to create value and one of the most challenging tasks for the policy makers. In this paper, we consider a performance criterion for the flowshop scheduling problem that aims to minimise a complex cost function, i.e., the sum of weighted tardiness and weighted flow-time costs. A heuristic and hybrid genetic algorithms are proposed and experimental results are provided. We address this trade-off and propose solution techniques that are easy for the shop-floor manager to implement. As scheduling function is an integral part of supply chain, the proposed solution minimises the opportunity losses and improves cost based supply chain performance. This paper addresses this interesting and challenging domain.

show abstract

“…Such applications are extremely varied, covering fields as diverse as chemistry (Cartwright and Harris, 1993), machine learning (Goldberg, 1989), and Operational Research (OR). Example applications in OR include: sequencing problems (Reeves, 1995), vehicle routing (Thangiah, 1995), and timetabling (Corne et al, 1993). A variety of textbooks are available though Michalewicz (1992) is a good starting point for those interested in how to apply EAs, whereas the more recent `Handbook of Evolutionary Computation' is recommended for its in-depth coverage of the field (Baeck et al, 1997).…”

Section: Figure 1: An Example Of Two-point Crossovermentioning

confidence: 99%

Local search: A guide for the information retrieval practitioner

MacFarlane

Tuson

2009

Information Processing & Management

View full text Add to dashboard Cite

This is the unspecified version of the paper.This version of the publication may differ from the final published version. Permanent repository link AbstractThere are a number of combinatorial optimisation problems in information retrieval in which the use of local search methods are worthwhile. The purpose of this paper is to show how local search can be used to solve some well known tasks in Information Retrieval (IR), how previous research in the field is piecemeal, bereft of a structure and methodologically flawed, and to suggest more rigorous ways of applying local search methods to solve IR problems. We provide a Query based taxonomy for analysing the use of local search in IR tasks and an overview of issues such as fitness functions, statistical significance and test collections when conducting experiments on combinatorial optimisation problems. The paper gives a guide on the pitfalls and problems for IR practitioners who wish to use local search to solve their research issues, and gives practical advice on the use of such methods. The Query based taxonomy is a novel structure which can be used by the IR practitioner in order to examine the use of local search in IR.

show abstract

A genetic algorithm for flowshop sequencing

Cited by 756 publications

References 9 publications

An electromagnetism-inspired method for a generalized flowshop problem

An electromagnetism-inspired method for a generalized flowshop problem

A hybrid genetic algorithm for a complex cost function for flowshop scheduling problem

Local search: A guide for the information retrieval practitioner

Contact Info

Product

Resources

About