Minimizing the makespan in a single machine scheduling problem with a time-based learning effect

Authors:
Wen-Hung Kuo;Dar-Li Yang
Affiliations:
Department of Industrial Engineering and Technology Management, Da-Yeh University, Chang-Hwa, Taiwan, R.O.C.;Department of Information Management, National Formosa University, Yun-Lin, Taiwan, R.O.C.
Venue:
Information Processing Letters
Year:
2006

Citing 2
Cited 6

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
A bi-criterion single-machine scheduling problem with learning considerations

Acta Informatica

Single-machine scheduling problems with start-time dependent processing time

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

Information Processing Letters
Single-machine scheduling with general learning functions

Computers & Mathematics with Applications
Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation

Journal of Scheduling
Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences

Computers & Mathematics with Applications
Experience-based approach to scheduling problems with the learning effect

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.89

Visualization

Abstract