Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times

2012 ◽  
Vol 39 (7) ◽  
pp. 1601-1604 ◽  
Author(s):  
Gur Mosheiov ◽  
Daniel Oron
Keyword(s):  
General Position ◽  
Processing Times ◽  
Number Of Tardy Jobs ◽  
Tardy Jobs

scholarly journals Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single Machine

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Jianbo Qian ◽  
George Steiner
Keyword(s):  
Single Machine ◽  
Single Machine Scheduling ◽  
Time Dependent ◽  
Scheduling Problems ◽  
Processing Times ◽  
Number Of Tardy Jobs ◽  
Special Cases ◽  
Programming Techniques ◽  
Weighted Number ◽  
Tardy Jobs

We consider single machine scheduling problems with learning/deterioration effects and time-dependent processing times, with due date assignment consideration, and our objective is to minimize the weighted number of tardy jobs. By reducing all versions of the problem to an assignment problem, we solve them inO(n4) time. For some important special cases, the time complexity can be improved to beO(n2) using dynamic programming techniques.

Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work

2021 ◽  
Vol 41 (2) ◽  
pp. 504-525
Author(s):  
Ruyan He ◽  
Jinjiang Yuan ◽  
C. T. Ng ◽  
T. C. E. Cheng
Keyword(s):  
Late Work ◽  
Number Of Tardy Jobs ◽  
Tardy Jobs
Sign in / Sign up

Export Citation Format

Share Document