A single-machine bi-criterion learning scheduling problem with release times

Authors:
Wen-Chiung Lee;Chin-Chia Wu;Ming-Fang Liu
Affiliations:
Department of Statistics, Feng Chia University, Taichung, Taiwan, ROC;Department of Statistics, Feng Chia University, Taichung, Taiwan, ROC;Department of Statistics, Feng Chia University, Taichung, Taiwan, ROC
Venue:
Expert Systems with Applications: An International Journal
Year:
2009

Citing 5
Cited 4

Improved genetic algorithm for the permutation flowshop scheduling problem

Computers and Operations Research
A bi-criterion single-machine scheduling problem with learning considerations

Acta Informatica
A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem

Expert Systems with Applications: An International Journal
A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem

Computers and Operations Research
An experienced learning genetic algorithm to solve the single machine total weighted tardiness scheduling problem

Expert Systems with Applications: An International Journal

Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times

Computers and Operations Research
A note on the learning effect in multi-agent optimization

Expert Systems with Applications: An International Journal
A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations

Computers and Industrial Engineering
Two-machine flowshop scheduling with truncated learning to minimize the total completion time

Computers and Industrial Engineering

Quantified Score

Hi-index	12.05

Visualization

Abstract

The learning effect in scheduling has received considerable attention recently. However, most researchers consider a single criterion with the assumption that jobs are all ready to be processed. The research of bi-criterion problems with learning effect is relatively limited. This paper studies a single-machine learning effect scheduling problem with release times where the objective is to minimize the sum of makespan and total completion time. First, we develop a branch-and-bound algorithm incorporating with several dominance properties and a lower bound to derive the optimal solution. Secondly, we propose a genetic algorithm to obtain near-optimal solutions. Finally, a computational experiment is conducted to evaluate the performance of the branch-and-bound and the genetic algorithms.