Name
Title | ||
|---|---|---|
Bicriterion Optimization for Flow Shop with a Learning Effect Subject to Release Dates. |
Abstract | ||
|---|---|---|
This paper investigates a two-machine flow shop problem with release dates in which the job processing times are variable according to a learning effect. The bicriterion is to minimize the weighted sum of makespan and total completion time subject to release dates. We develop a branch-and-bound (B&B) algorithm to solve the problem by using a dominance property, several lower bounds, and an upper bound to speed up the elimination process of the search tree. We further propose a multiobjective memetic algorithm (MOMA), enhanced by an initialization strategy and a global search strategy, to obtain the Pareto front of the problem. Computational experiments are also carried out to examine the effectiveness and the efficiency of the B&B algorithm and the MOMA algorithm. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1155/2018/9149510 | COMPLEXITY |
Field | DocType | Volume |
Memetic algorithm,Mathematical optimization,Learning effect,Job shop scheduling,Upper and lower bounds,Control theory,Flow shop scheduling,Multi-objective optimization,Initialization,Mathematics,Search tree | Journal | 2018 |
ISSN | Citations | PageRank |
1076-2787 | 0 | 0.34 |
References | Authors | |
28 | 3 | |