Two-machine flowshop scheduling with truncated learning to minimize the total completion time

Authors:
Der-Chiang Li;Peng-Hsiang Hsu;Chin-Chia Wu;T. C. E. Cheng
Affiliations:
Department of Industrial and Information Management, National Cheng Kung University, No. 1, University Road, Tainan City 70101, Taiwan, ROC;Department of Industrial and Information Management, National Cheng Kung University, No. 1, University Road, Tainan City 70101, Taiwan, ROC;Department of Statistics, Feng Chia University, Taichung, Taiwan, ROC;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 16
Cited 2

Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n/2/F/ F

Journal of the ACM (JACM)
Minimizing Total Completion Time in a Two-Machine

Mathematics of Operations Research
Single-machine group scheduling with a time-dependent learning effect

Computers and Operations Research
Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects

Information Sciences: an International Journal
A new approach to the learning effect: Beyond the learning curve restrictions

Computers and Operations Research
Some scheduling problems with general position-dependent and time-dependent learning effects

Information Sciences: an International Journal
A single-machine bi-criterion learning scheduling problem with release times

Expert Systems with Applications: An International Journal
Solution algorithms for the makespan minimization problem with the general learning model

Computers and Industrial Engineering
Two-machine flow shop problem with effects of deterioration and learning

Computers and Industrial Engineering
Single-machine scheduling problems with deteriorating jobs and learning effects

Computers and Industrial Engineering
Experience-based approach to scheduling problems with the learning effect

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Scheduling problems with deteriorating jobs and learning effects including proportional setup times

Computers and Industrial Engineering
Scheduling with job-dependent learning effects and multiple rate-modifying activities

Information Processing Letters
Single-machine scheduling with learning effect and resource-dependent processing times

Computers and Industrial Engineering
A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations

Computers and Industrial Engineering
Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning

Mathematical and Computer Modelling: An International Journal

Bi-criteria minimization for the permutation flowshop scheduling problem with machine-based learning effects

Computers and Industrial Engineering
Uniform parallel-machine scheduling to minimize makespan with position-based learning curves

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scheduling with learning effects has received a lot of research attention lately. However, the flowshop setting is relatively unexplored. On the other hand, the actual processing time of a job under an uncontrolled learning effect will drop to zero precipitously as the number of jobs increases. This is rather absurd in reality. Motivated by these observations, we consider a two-machine flowshop scheduling problem in which the actual processing time of a job in a schedule is a function of the job's position in the schedule and a control parameter of the learning function. The objective is to minimize the total completion time. We develop a branch-and-bound and three simulated annealing algorithms to solve the problem. Computational results show that the proposed algorithms are efficient in producing near-optimal solutions.