JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Efficient Heuristics for Flowshop Scheduling for Minimizing the Makespan and Total Flowtime of Jobs
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Efficient Heuristics for Flowshop Scheduling for Minimizing the Makespan and Total Flowtime of Jobs
Hirakawa, Yasuhiro; Ishigaki, Aya;
  PDF(new window)
 Abstract
The problem of scheduling in permutation flowshops has been extensively investigated by many researchers. Recently, attempts are being made to consider more than one objective simultaneously and develop algorithms to obtain a set of Pareto-optimal solutions. Varadharajan et al. (2005) presented a multi-objective simulated-annealing algorithm (MOSA) for the problem of permutation-flowshop scheduling with the objectives of minimizing the makespan and the total flowtime of jobs. The MOSA uses two initial sequences obtained using heuristics, and seeks to obtain non-dominated solutions through the implementation of a probability function, which probabilistically selects the objective of minimizing either the makespan or the total flowtime of jobs. In this paper, the same problem of heuristically developing non-dominated sequences is considered. We propose an effective heuristics based on simulated annealing (SA), in which the weighted sum of the makespan and the total flowtime is used. The essences of the heuristics are in selecting the initial sequence, setting the weight and generating a solution in the search process. Using a benchmark problem provided by Taillard (1993), which was used in the MOSA, these conditions are extracted in a large-scale experiment. The non-dominated sets obtained from the existing algorithms and the proposed heuristics are compared. It was found that the proposed heuristics drastically improved the performance of finding the non-dominated frontier.
 Keywords
Flowshop scheduling;Makespan;Flowtime;Multi-objectives;Simulated annealing;
 Language
English
 Cited by
 References
1.
Varadharajan, T. K. and Rajendran, C. (2005), A multiobjective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs, European Journal of Operational Research, 167, 772-795. crossref(new window)

2.
Taillard, E. (1993), Benchmark for basic scheduling problems, European Journal of Operational Research, 64, 278-285. crossref(new window)

3.
Ishibuchi, H. and Murata, T. (1998), A Multi-objective Genetic Local Search Algorithm and Its Application to Flowshop Scheduling, IEEE Transactions on Systems, Man and Cybernetics-Part C: Applications and Reviews, 28, 392-403. crossref(new window)

4.
Ulungu, E. L., Teghem, J., Fortemps, P. H., and Tuyttens, D. (1999), MOSA Method: A tool for solving multiobjective combinatorial optimization problems, Journal of Multicriteria Decision Analysis, 8, 221-236. crossref(new window)

5.
Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P. (1983), Optimization by simulated annealing, Science, 220, 671-680. crossref(new window)

6.
Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and Teller, E. (1953), Equation of State Calculation by Fast Computing Machines, Journal of Chemical Physics, 21, 1087-1092. crossref(new window)