scholarly journals EFFICIENT EXACT MINIMIZATION OF TOTAL TARDINESS IN TIGHT-TARDY PROGRESSIVE SINGLE MACHINE SCHEDULING WITH IDLING-FREE PREEMPTIONS OF EQUAL-LENGTH JOBS

2020 ◽  
Vol 0 (1) ◽  
pp. 27-39
Author(s):  
Vadim V. Romanuke
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Equal Length ◽  
Total Tardiness

SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE PRIMARY CRITERION

2010 ◽  
Vol 27 (05) ◽  
pp. 577-585 ◽  
Author(s):  
CHENG HE ◽  
YIXUN LIN ◽  
JINJIANG YUAN
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Total Tardiness ◽  
Scheduling Problem ◽  
Np Hard ◽  
Assignment Problems ◽  
Running Time ◽  
Minimization Problems ◽  
Hierarchical Minimization

It is well-known that a single machine scheduling problem of minimizing the total tardiness is NP-hard. Recently, Liu, Ng and Cheng solved some special hierarchical minimization problems with total tardiness as the primary criterion by the Algorithm TAP (Two Assignment Problems) in O(n3) time. And in this paper we present some algorithms for these problems with running time O(n log n).

Sign in / Sign up

Export Citation Format

Share Document