Single Machine Scheduling Models with Learning Effects on the Sum of Setup and Processing Times

2021 ◽  
Vol 46 (4) ◽  
pp. 33-42
Author(s):  
Un Gi Joo
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Learning Effects ◽  
Processing Times ◽  
Scheduling Models

scholarly journals Single-Machine Scheduling with Learning Effects and Maintenance: A Methodological Note on Some Polynomial-Time Solvable Cases

2017 ◽  
Vol 2017 ◽  
pp. 1-6
Author(s):  
Kuo-Ching Ying ◽  
Chung-Cheng Lu ◽  
Shih-Wei Lin ◽  
Jie-Ning Chen
Keyword(s):  
Polynomial Time ◽  
Single Machine ◽  
Machine Scheduling ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Single Machine Scheduling ◽  
Learning Effects ◽  
Scheduling Problems ◽  
Maintenance Activity ◽  
Processing Times

This work addresses four single-machine scheduling problems (SMSPs) with learning effects and variable maintenance activity. The processing times of the jobs are simultaneously determined by a decreasing function of their corresponding scheduled positions and the sum of the processing times of the already processed jobs. Maintenance activity must start before a deadline and its duration increases with the starting time of the maintenance activity. This work proposes a polynomial-time algorithm for optimally solving two SMSPs to minimize the total completion time and the total tardiness with a common due date.

Single machine scheduling with a variable common due date and resource-dependent processing times

2003 ◽  
Vol 30 (8) ◽  
pp. 1173-1185 ◽  
Author(s):  
C.T.Daniel Ng ◽  
T.C.Edwin Cheng ◽  
Mikhail Y. Kovalyov ◽  
S.S. Lam
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Due Date ◽  
Common Due Date ◽  
Processing Times

Single Machine Scheduling and due Date Assignment with Past-Sequence-Dependent Delivery Times and General Position-Dependent Processing Times

2014 ◽  
Vol 624 ◽  
pp. 675-680
Author(s):  
Yu Fang Zhao
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problems ◽  
Due Date ◽  
Due Date Assignment ◽  
Processing Times ◽  
Delivery Times ◽  
Weighted Number ◽  
Tardy Jobs

We studied single machine scheduling problems in which the jobs need to be delivered to customers after processing. It is assumed that the delivery times are proportional to the length of the already processed jobs, and a job's processing time depended on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs and the cost of due date assignment. We analyzed these problems with two different due date assignment methods and conclude that the problems are polynomial time solvable.

Sign in / Sign up

Export Citation Format

Share Document