Scheduling;
Deteriorating job;
delivery time;
Common due date;
Slack due date;
Different due date;
Earliness;
Tardiness;
SINGLE-MACHINE;
PROCESSING-TIMES;
MINIMIZE;
D O I:
10.1007/s12190-021-01607-9
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
This paper considers the single machine scheduling problem with three different due dates in which the actual processing time of the job is a simple deterioration function of the starting time. The goal is to minimize the total costs that contain the earliness, tardiness and due date. We prove that these problems are polynomial time solvable, and we propose the corresponding algorithms to obtain the optimal sequence and due date.
机构:
Zhengzhou Univ, Dept Math, Zhengzhou 450001, Henan, Peoples R ChinaHong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
Li, Shisheng
Ng, C. T.
论文数: 0引用数: 0
h-index: 0
机构:
Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R ChinaHong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
Ng, C. T.
Yuan, Jinjiang
论文数: 0引用数: 0
h-index: 0
机构:
Zhengzhou Univ, Dept Math, Zhengzhou 450001, Henan, Peoples R ChinaHong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
机构:
Zhengzhou Univ, Dept Math, Zhengzhou 450001, Henan, Peoples R ChinaHong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
Li, Shisheng
Ng, C. T.
论文数: 0引用数: 0
h-index: 0
机构:
Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R ChinaHong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
Ng, C. T.
Yuan, Jinjiang
论文数: 0引用数: 0
h-index: 0
机构:
Zhengzhou Univ, Dept Math, Zhengzhou 450001, Henan, Peoples R ChinaHong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China