Single machine scheduling with past-sequence-dependent setup times and learning effects

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:
Information Processing Letters
Year:
2007

Citing 2
Cited 7

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 with past-sequence-dependent setup times and time-dependent learning effect

Computers and Industrial Engineering
Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times

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
Scheduling with job-dependent learning effects and multiple rate-modifying activities

Information Processing Letters
Total absolute deviation of job completion times on uniform and unrelated machines

Computers and Operations Research
Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs

Computers and Industrial Engineering
Some unrelated parallel machine scheduling problems with past-sequence-dependent setup time and learning effects

Computers and Industrial Engineering

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper studies a single machine scheduling problem with setup times and learning considerations. The setup times are proportional to the length of the already scheduled jobs. That is, the setup times are past-sequence-dependent. It is assumed that the learning process reflects a decrease in the process time as a function of the number of repetitions, i.e., as a function of the job position in the sequence. The following objectives are considered: the makespan, the total completion time, the total absolute differences in completion times and the sum of earliness, tardiness and common due-date penalty. Polynomial time algorithms are proposed to optimally solve the above objective functions.