Single machine scheduling problem with fuzzy due date and processing time

1998 ◽  
Vol 21 (2) ◽  
pp. 189-196 ◽  
Author(s):  
Li‐Man Liao ◽  
Ching‐Jong Liao
Keyword(s):  
Single Machine ◽  
Processing Time ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Due Date

scholarly journals Single-Machine Scheduling with Workload-Dependent Maintenance Duration to Minimize Maximum Lateness

2015 ◽  
Vol 2015 ◽  
pp. 1-5 ◽  
Author(s):  
Ting Wang ◽  
Dehua Xu
Keyword(s):  
Single Machine ◽  
Time Window ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Maximum Lateness ◽  
Scheduling Problem ◽  
Due Date ◽  
Start Time ◽  
Tight Bound ◽  
Special Cases

A single-machine scheduling problem with a mandatory maintenance whose duration is workload-dependent is considered. The start time of the maintenance is restricted to a time window. The objective is to determine the start time of the maintenance and schedule all the jobs to the machine such that the maximum lateness is minimized. An approximation algorithm based on the classical Earliest Due Date first rule is proposed. It is showed that the proposed algorithm is optimal for some special cases and that it has a tight bound for the scheduling problem under consideration.

Due-Date Assignment on a Single Machine Scheduling Problem with Nonlinear Deterioration Function

2013 ◽  
Vol 645 ◽  
pp. 280-284
Author(s):  
Hua Ping Wu ◽  
Min Huang ◽  
Vincent Cho ◽  
W.H. Ip ◽  
Xing Wei Wang
Keyword(s):  
Single Machine ◽  
Real World ◽  
Processing Time ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Due Dates ◽  
Due Date ◽  
Due Date Assignment ◽  
Non Linear ◽  
Normal Processing

The paper considers the due-date assignment problem with a non-linear deterioration in which the due dates are determined by the equal slack method. Here, the processing time of a job is defined by a non-linear function of total normal processing time of jobs in front of it in the sequence. The objective is to minimize the total tardiness penalties. According to the needs from the real world, the problem is divided into two cases, i.e., allowing with early jobs and no early jobs respectively. The related lemma, corollary and theorems for the problems are proposed and proved. At the same time, it shows that the problems in this paper can be solved in the polynomial times.

Sign in / Sign up

Export Citation Format

Share Document