Journal
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
Volume 44, Issue 11-12, Pages 1181-1190Publisher
SPRINGER LONDON LTD
DOI: 10.1007/s00170-007-1236-0
Keywords
No-wait flexible lot streaming scheduling; Genetic algorithm; Flow shop scheduling; Machine scheduling; Flexible manufacturing system
Funding
- National Research Foundation of Korea [핵C6A2406] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)
Ask authors/readers for more resources
In this paper, we propose a flow shop scheduling problem with no-wait flexible lot streaming. The problem involves the splitting of order quantities of different products into sublots and considers alternative machines with different processing times. Sublots of a particular product are not allowed to intermingle; that is, sublots of different products must be non-preemptive. The objective of the problem is the minimization of the makespan. An adaptive genetic algorithm (GA) is proposed, which is composed of three main steps. The first step is a position-based crossover of products and local-search-based mutation for better offspring. The second step is an iterative hill-climbing algorithm to improve the current generation. The last step is the adaptive regulation of the crossover and mutation rates. Experimental results are presented for various sizes of problems to describe the performance of the proposed algorithm and they show promising outcome compared to traditional GAs.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available