scholarly journals EFFICIENCY RESEARCH OF ALGORITHM FOR A FEASIBLE SCHEDULE CONSTRUCTION BY THE TOTAL EARLINESS MINIMIZATION CRITERION ON SINGLE MACHINE WITH DIFFERENT DUE DATES

2019 ◽  
Vol 9 (3) ◽  
pp. 178-186
Author(s):  
Khalus E.A. ◽  
Keyword(s):  
Single Machine ◽  
Due Dates ◽  
Feasible Schedule

Setting due dates in a stochastic single machine environment

2006 ◽  
Vol 33 (6) ◽  
pp. 1681-1694 ◽  
Author(s):  
Victor Portougal ◽  
Dan Trietsch
Keyword(s):  
Single Machine ◽  
Due Dates

A heuristic approach for single-machine scheduling with due dates and class setups

2001 ◽  
Vol 28 (11) ◽  
pp. 1111-1130 ◽  
Author(s):  
Jason Chao-Hsien Pan ◽  
Jen-Shiang Chen ◽  
Hung-Liang Cheng
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Heuristic Approach ◽  
Due Dates

scholarly journals Stochastic Single Machine JIT Scheduling with Geometric Processing Times and Due Dates

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Yuncheng Luo
Keyword(s):  
Single Machine ◽  
Optimal Schedule ◽  
Dynamic Programming Algorithm ◽  
Programming Algorithm ◽  
Scheduling Problem ◽  
Due Dates ◽  
Common Mean ◽  
Processing Times ◽  
Tardy Jobs ◽  
Special Case

In this paper, we investigate a static stochastic single machine JIT scheduling problem in which the jobs’ processing times are stochastically independent and follow geometric distributions whose mean is provided, due dates are geometrically distributed with a common mean, and both the unit penalty of earliness/tardiness and the fixed penalty of earliness/tardiness are deterministic and different. The objective is to minimize the expected total penalties for quadratic earliness, quadratic tardiness, and early and tardy jobs. We prove that the optimal schedule to minimize this problem is V-shaped with respect to the ratio of mean processing time to unit tardiness penalty under the specific condition. Also, we show a special case and two theorems related to this JIT scheduling problem under specific situations where the optimal solutions exist. Finally, based on the V-shaped characteristic, a dynamic programming algorithm is designed to achieve an optimal V-shaped schedule in pseudopolynomial time.

Sign in / Sign up

Export Citation Format

Share Document