Two due date assignment problems with position-dependent processing time on a single-machine

Authors:
Chou-Jung Hsu;Suh-Jenq Yang;Dar-Li Yang
Affiliations:
Department of Industrial Engineering and Management, Nan Kai University of Technology, Nan-Tou 542, Taiwan;Department of Industrial Engineering and Management, Nan Kai University of Technology, Nan-Tou 542, Taiwan;Department of Information Management, National Formosa University, Yun-Lin 632, Taiwan
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 3
Cited 1

Sequencing with earliness and tardiness penalties: a review

Operations Research
A survey of scheduling with controllable processing times

Discrete Applied Mathematics
Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey

Mathematical and Computer Modelling: An International Journal

Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

The focus of this study is to analyze single-machine scheduling and due date assignment problems with position-dependent processing time. Two generally positional deterioration models and two frequent due date assignment methods are investigated. The objective functions include the cost of changing the due dates, the total cost of positional weight earliness, and the total cost of the discarded jobs that cannot be completed by their due dates. We conclude that the problems are polynomial time solvable. Significantly enough, after assessing the special case of each problem, this research found out that they can be optimally solved by lower order algorithms.