Journal
APPLIED MATHEMATICAL MODELLING
Volume 36, Issue 10, Pages 5001-5014Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.apm.2011.12.038
Keywords
Scheduling; Two-machine; Genetic algorithm; Truncated learning function
Funding
- NSC [NSC 100-2221-E-035-032]
Ask authors/readers for more resources
Scheduling with learning effects has received continuing attention in the recent days. However, it can be found that the actual processing time of a given job drops to zero precipitously as the job has a big processing time or the number of jobs increases. Moreover, most researchers paid more attention to single-machine settings, and the flowshop settings then are relatively unexplored. Motivated by these observations, we consider a two-machine total completion time flowshop problem in which the actual job processing time is a function depending on the jobs that have already been processed and a control parameter. In this paper, we develop a branch-and-bound and a genetic heuristic-based algorithm for the problem. In addition, the experimental results of all proposed algorithms are also provided. (C) 2011 Elsevier Inc. All rights reserved.
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