The single-machine total weighted tardiness scheduling problem with position-based learning effects

Authors:
Yunqiang Yin;Chin-Chia Wu;Wen-Hsiang Wu;Shuenn-Ren Cheng
Affiliations:
State Key Laboratory Breeding Base of Nuclear Resources and Environment, East China Institute of echnology, Nanchang, 330013, China and School of Sciences, East China Institute of Technology, Fuzh ...;Department of Statistics, Feng Chia University, Taichung, Taiwan;Department of Healthcare Management, Yuanpei University, Hsinchu, Taiwan;Graduate Institute of Business Administration, Cheng Shiu University, Kaohsiung County, Taiwan
Venue:
Computers and Operations Research
Year:
2012

Citing 5
Cited 3

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

Acta Informatica
A new approach to the learning effect: Beyond the learning curve restrictions

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

Information Sciences: an International Journal
Solution algorithms for the makespan minimization problem with the general learning model

Computers and Industrial Engineering
Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations

Information Sciences: an International Journal

Makespan minimization flowshop with position dependent job processing times-computational complexity and solution algorithms

Computers and Operations Research
Single machine scheduling with autonomous learning and induced learning

Computers and Industrial Engineering
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.01

Visualization

Abstract

This study addresses the problem of minimizing the total weighted tardiness on a single-machine with a position-based learning effect. Several dominance properties are established to develop branch and bound algorithm and a lower bound is provided to derive the optimal solution. In addition, three heuristic procedures are developed for near-optimal solutions. Computational results are also presented to evaluate the performance of the proposed algorithms.