A fast tabu search algorithm for the permutation flow-shop problem

Nowicki, Eugeniusz; Smutnicki, Czesław

doi:10.1016/0377-2217(95)00037-2

Cited by 379 publications

(156 citation statements)

References 20 publications

Supporting

Mentioning

140

Contrasting

Order By: Relevance

“…An example is the tabu search algorithm of Nowicki and Smutnicki (1996b) that uses a neighbourhood that destroys the critical path in a network representation of the schedule. Specifically, Nowicki and Smutnicki define blocks of operations with respect to a critical path in the schedule defined by the current solution, where a block is a maximal set of successive critical operations that require the same machine.…”

Section: Flow Shopmentioning

confidence: 99%

Fifty years of scheduling: a survey of milestones

Potts

Strusevich

2009

Journal of the Operational Research Society

172

View full text Add to dashboard Cite

Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear. A discussion of the main topics of scheduling research for the past five decades is provided, highlighting the key contributions that helped shape the subject. The main topics covered in the respective decades are combinatorial analysis, branch and bound, computational complexity and classification, approximate solution algorithms, and enhanced scheduling models.

show abstract

Section: Flow Shopmentioning

confidence: 99%

Fifty years of scheduling: a survey of milestones

Potts

Strusevich

2009

Journal of the Operational Research Society

172

View full text Add to dashboard Cite

show abstract

“…This is the most popular distribution to generate processing times in the literature (see e.g. [13,25,29,34]), as it is known to provide most difficult problem instances, although it is hardly found in practice [38]. In our experiments, we consider a uniform distribution between 1 and 99, which is widely used in the literature.…”

Section: Design Of Experimentsmentioning

confidence: 99%

Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

González

2009

Computers & Operations Research

View full text Add to dashboard Cite

In this paper, we address the problem of scheduling a set of jobs in a flowshop with makespan objective. In contrast to the usual assumption of machine availability presented in most research, we consider that machines may not be available at the beginning of the planning period, due to processing of previously scheduled jobs. We first formulate the problem, analyse the structure of solutions depending on a number of factors (such as machines, jobs, structure of the processing times, availability vectors, etc.), and compare it with its classical counterpart. Results indicate that the problem under consideration presents a different structure of solutions, and that it is easier than the classical permutation flowshop problem. In view of these results, we propose and test a number of fast heuristics for the problem.

show abstract

“…Skipping consciously the long list of papers dealing with this subject we only refer the reader to the recent reviews and the best up-to-now algorithms [5,6].…”

Section: Permutation Flow Shop Problemmentioning

confidence: 99%

“…This work constitutes the continuation of authors research on constructing efficient algorithms applied to solve hard combinatorial problems ( [2,5,6]). …”

Section: Introductionmentioning

confidence: 99%

Parallel Calculating of the Goal Function in Metaheuristics Using GPU

Bożejko

Smutnicki

Uchroński

2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We consider a metaheuristic optimization algorithm which uses single process (thread) to guide the search through the solution space. Thread performs in the cyclic way (iteratively) two main tasks: the goal function evaluation for a single solution or a set of solutions and management (solution filtering and selection, collection of history, updating). The latter task takes statistically 1-3% total iteration time, therefore we skip its acceleration as useless. The former task can be accelerated in parallel environments in various manners. We propose certain parallel small-grain calculation model providing the cost optimal method. Then, we carry out an experiment using Graphics Processing Unit (GPU) to confirm our theoretical results.

show abstract

A fast tabu search algorithm for the permutation flow-shop problem

Cited by 379 publications

References 20 publications

Fifty years of scheduling: a survey of milestones

Fifty years of scheduling: a survey of milestones

Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

Parallel Calculating of the Goal Function in Metaheuristics Using GPU

Contact Info

Product

Resources

About