scholarly journals Batch scheduling and common due-date assignment on a single machine

1996 ◽  
Vol 70 (3) ◽  
pp. 231-245 ◽  
Author(s):  
T.C.Edwin Cheng ◽  
Mikhail Y. Kovalyov
Keyword(s):  
Single Machine ◽  
Batch Scheduling ◽  
Due Date ◽  
Due Date Assignment ◽  
Common Due Date

scholarly journals Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment

2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Long Wan
Keyword(s):  
Single Machine ◽  
Optimal Solution ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Due Date ◽  
Due Date Assignment ◽  
Common Due Date ◽  
Optimal Polynomial ◽  
Special Case ◽  
Identical Jobs

We investigate a common due-date assignment scheduling problem with a variable maintenance on a single machine. The goal is to minimize the total earliness, tardiness, and due-date cost. We derive some properties on an optimal solution for our problem. For a special case with identical jobs we propose an optimal polynomial time algorithm followed by a numerical example.

Sign in / Sign up

Export Citation Format

Share Document