Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect

Authors:
Wen-Hung Kuo;Chou-Jung Hsu;Dar-Li Yang
Affiliations:
Department of Information Management, National Formosa University, Yun-Lin 632, Taiwan;Department of Industrial Engineering and Management, Nan Kai University of Technology, Nan-Tou 542, Taiwan;Department of Information Management, National Formosa University, Yun-Lin 632, Taiwan
Venue:
Information Sciences: an International Journal
Year:
2012

Citing 19
Cited 4

A two-machine flowshop sequencing problem with limited waiting time constraints

Computers and Industrial Engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A bi-criterion single-machine scheduling problem with learning considerations

Acta Informatica
Single-machine group scheduling with a time-dependent learning effect

Computers and Operations Research
Single-machine scheduling problems with the time-dependent learning effect

Computers & Mathematics with Applications
The learning effect: Getting to the core of the problem

Information Processing Letters
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
Solution algorithms for the makespan minimization problem with the general learning model

Computers and Industrial Engineering
Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations

Information Sciences: an International Journal
Some single-machine and m-machine flowshop scheduling problems with learning considerations

Information Sciences: an International Journal
Experience-based approach to scheduling problems with the learning effect

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Minimizing the makespan in a single machine scheduling problem with a time-based learning effect

Information Processing Letters
Minimizing the makespan on a single machine with learning and unequal release times

Computers and Industrial Engineering
Note on "Single-machine and flowshop scheduling with a general learning effect model" and "Some single-machine and m-machine flowshop scheduling problems with learning considerations"

Information Sciences: an International Journal
Scheduling problems with general effects of deterioration and learning

Information Sciences: an International Journal
A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations

Computers and Industrial Engineering
Notes on "some single-machine scheduling problems with general position-dependent and time-dependent learning effects"

Information Sciences: an International Journal

Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position

Information Sciences: an International Journal
Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities

Information Sciences: an International Journal
Flowshop scheduling with a general exponential learning effect

Computers and Operations Research
Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

In this paper, we investigate a time-dependent learning effect in a flowshop scheduling problem. We assume that the time-dependent learning effect of a job was a function of the total normal processing time of jobs scheduled before the job. The following objective functions are explored: the makespan, the total flowtime, the sum of weighted completion times, the sum of the kth power of completion times, and the maximum lateness. Some heuristic algorithms with worst-case analysis for the objective functions are given. Moreover, a polynomial algorithm is proposed for the special case with identical processing time on each machine and that with an increasing series of dominating machines, respectively. Finally, the computational results to evaluate the performance of the heuristics are provided.