A bi-criterion single-machine scheduling problem with learning considerations

Authors:
Wen-Chiung Lee;Chin-Chia Wu;Hua-Jung Sung
Affiliations:
Feng Chia University, Department of Statistics, Taiwan;Feng Chia University, Department of Statistics, Taiwan;Feng Chia University, Department of Statistics, Taiwan
Venue:
Acta Informatica
Year:
2004

Citing 0
Cited 24

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

Information Processing Letters
Single-machine group scheduling with a time-dependent learning effect

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

Information Processing Letters
Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects

Information Sciences: an International Journal
Single-machine scheduling with general learning functions

Computers & Mathematics with Applications
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
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
Single-machine and flowshop scheduling with a general learning effect model

Computers and Industrial Engineering
Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences

Computers & Mathematics with Applications
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
Single-machine scheduling with learning effect and deteriorating jobs

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
Minimizing the makespan in a single machine scheduling problem with a time-based learning effect

Information Processing Letters
Scheduling with job-dependent learning effects and multiple rate-modifying activities

Information Processing Letters
Some single-machine scheduling problems with general effects of learning and deterioration

Computers & Mathematics with Applications
Notes on "some single-machine scheduling problems with general position-dependent and time-dependent learning effects"

Information Sciences: an International Journal
The single-machine total weighted tardiness scheduling problem with position-based learning effects

Computers and Operations Research
Scheduling with general position-based learning curves

Information Sciences: an International Journal
Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect

Information Sciences: an International Journal
An Agent Based Approach to Patient Scheduling Using Experience Based Learning

International Journal of Agent Technologies and Systems
A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conventionally, job processing times are assumed to be constant from the first job to be processed until the last job to be completed. However, recent empirical studies in several industries have verified that unit costs decline as firms produce more of a product and gain knowledge or experience. This phenomenon is known as the “learning effect.” This paper focuses on a bi-criterion single-machine scheduling problem with a learning effect. The objective is to find a sequence that minimizes a linear combination of the total completion time and the maximum tardiness. A branch-and-bound and a heuristic algorithm are proposed to search for optimal and near-optimal solutions, respectively. Computational results are also provided for the problem.