scholarly journals Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming

2010 ◽  
Vol 13 (6) ◽  
pp. 597-607 ◽  
Author(s):  
Débora P. Ronconi ◽  
Warren B. Powell
Keyword(s):  
Dynamic Programming ◽  
Single Machine ◽  
Approximate Dynamic Programming ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Total Tardiness ◽  
Scheduling Problem

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).

Single Machine Scheduling with Discretely Compressible Processing Times

2013 ◽  
Vol 787 ◽  
pp. 1020-1024
Author(s):  
Shu Xia Zhang ◽  
Yu Zhong Zhang
Keyword(s):  
Dynamic Programming ◽  
Single Machine ◽  
Processing Time ◽  
Machine Scheduling ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Processing Times ◽  
Release Times

In this paper, we address the single machine scheduling problem with discretely compressible processing times, where processing any job with a compressed processing time incurs a corresponding compression cost. We consider the following problem: scheduling with discretely compressible processing times to minimize makespan with the constraint of total compression cost. Jobs may have different release times. We design a pseudo-polynomial time algorithm by approach of dynamic programming and an FPTAS.

Sign in / Sign up

Export Citation Format

Share Document