RELATIVE ROBUSTNESS FOR SINGLE-MACHINE SCHEDULING PROBLEM WITH PROCESSING TIME UNCERTAINTY

2002 ◽  
Vol 19 (5) ◽  
pp. 59-67 ◽  
Author(s):  
Chun-Yi Kuo ◽  
Feng-Jyh Lin
Keyword(s):  
Single Machine ◽  
Processing Time ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Time Uncertainty ◽  
Relative Robustness

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.

scholarly journals Single-Machine Scheduling with Upper Bounded Maintenance Time under the Deteriorating Effect

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Pengfei Xue ◽  
Yulin Zhang
Keyword(s):  
Single Machine ◽  
Upper Bound ◽  
Processing Time ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Maintenance Time ◽  
Optimal Maintenance ◽  
Special Case ◽  
Actual Processing Time

We consider a single-machine scheduling problem with upper bounded actual processing time and upper bounded maintenance time under deteriorating effect. The actual processing time of a job is a position-dependent power function. If the actual processing time of a job exceeds the upper bound, tardiness penalty of the job should be paid. And if the maintenance time exceeds the corresponding upper bound, tardiness penalty of the maintenance should also be paid. The maintenance duration studied in the paper is a position-dependent exponential function. The objective is to find jointly the optimal maintenance frequency and the optimal job sequence to minimize the total cost, which is a linear function of the makespan and the total tardiness. We show that the studied scheduling problem can be transformed as a classic assignment problem to solve. There is also shown that a special case of the scheduling problem can be optimally solved by a lower order algorithm.

An Optimal Algorithm for Scheduling with Variable Job Processing Times and Rejection

2015 ◽  
Vol 775 ◽  
pp. 449-452
Author(s):  
Ji Bo Wang ◽  
Chou Jung Hsu
Keyword(s):  
Objective Function ◽  
Polynomial Time ◽  
Single Machine ◽  
Processing Time ◽  
Optimal Algorithm ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Processing Times ◽  
Rejection Penalty

This paper studies a single machine scheduling problem with rejection. Each job has a variable processing time and a rejection penalty. The objective function is to minimize the sum of the makespan of the accepted jobs and the total rejection penalty of the rejected jobs. We show that the problem can be solved in polynomial time.

Sign in / Sign up

Export Citation Format

Share Document