Journal
OPTIMIZATION LETTERS
Volume 6, Issue 7, Pages 1393-1409Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s11590-011-0334-y
Keywords
Scheduling; Flow shop; Deteriorating jobs; Learning effect; Makespan; Branch-and-bound algorithm
Funding
- Hong Kong Polytechnic University [G-YJ35]
- National Natural Science Foundation of China [11001181]
Ask authors/readers for more resources
We consider a two-machine flow shop scheduling problem with effects of deterioration and learning. By the effects of deterioration and learning, we mean that the processing time of a job is a function of its execution starting time and its position in a sequence. The objective is to find a sequence that minimizes the makespan. Several dominance properties and two lower bounds are derived, which are used to speed up the elimination process of a branch-and-bound algorithm proposed to solve the problem. Two heuristic algorithms are also proposed to obtain near-optimal solutions. Computational results are presented to evaluate the performance of the proposed algorithms.
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