Single-machine scheduling problems with the time-dependent learning effect

Authors:
Wen-Hung Kuo;Dar-Li Yang
Affiliations:
Department of Information Management, National Formosa University, Yun-Lin, 632, Taiwan;Department of Information Management, National Formosa University, Yun-Lin, 632, Taiwan
Venue:
Computers & Mathematics with Applications
Year:
2007

Citing 1
Cited 5

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

Computers and Operations Research

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

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
Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect

Information Sciences: an International Journal
The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model

Information Sciences: an International Journal
Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models

Computers and Operations Research

Quantified Score

Hi-index	0.09

Visualization

Abstract

In this paper, three single-machine scheduling problems with time-dependent learning effect model to minimize the sum of weighted completion times, the sum of the kth powers of completion times and the maximum lateness are investigated. We show that the shortest processing time first (SPT) rule is an optimal solution for the problem to minimize the sum of the kth powers of completion times. Some polynomial time solutions are provided for the other two problems under certain conditions, respectively.