A 2-Approximation Algorithm for the Single Machine Due Date Assignment Scheduling Problem in Fuzzy Environment to Minimize the Total Costs

2015 ◽  
Author(s):  
Jinquan Li ◽  
Jinhua Zhang
Keyword(s):  
Approximation Algorithm ◽  
Single Machine ◽  
Scheduling Problem ◽  
Due Date ◽  
Due Date Assignment ◽  
Fuzzy Environment

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.

A Batch Scheduling Problem with Two Agents

2015 ◽  
Vol 32 (06) ◽  
pp. 1550044 ◽  
Author(s):  
Byung-Cheon Choi ◽  
Myoung-Ju Park
Keyword(s):  
Approximation Algorithm ◽  
Optimality Conditions ◽  
Single Machine ◽  
Completion Time ◽  
Polynomial Algorithm ◽  
Batch Scheduling ◽  
Scheduling Problem ◽  
Np Hard ◽  
Due Date ◽  
Processing Times

In this paper, we consider a two-agent batch scheduling problem on a single machine such that the processing times of agent 1 and the due date of agent 2 in the same batch are identical. The objective is to minimize the total completion time of agent 1 with a constraint on the maximum tardiness of agent 2. First, we propose the optimality conditions. Then, we show that the problem is strongly NP-hard. Finally, we prove the problem remains NP-hard even for the case with one batch of agent 2, and develop a pseudo-polynomial algorithm and an approximation algorithm for this case.

Single Machine Scheduling and due Date Assignment with Past-Sequence-Dependent Delivery Times and General Position-Dependent Processing Times

2014 ◽  
Vol 624 ◽  
pp. 675-680
Author(s):  
Yu Fang Zhao
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problems ◽  
Due Date ◽  
Due Date Assignment ◽  
Processing Times ◽  
Delivery Times ◽  
Weighted Number ◽  
Tardy Jobs

We studied single machine scheduling problems in which the jobs need to be delivered to customers after processing. It is assumed that the delivery times are proportional to the length of the already processed jobs, and a job's processing time depended on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs and the cost of due date assignment. We analyzed these problems with two different due date assignment methods and conclude that the problems are polynomial time solvable.

Sign in / Sign up

Export Citation Format

Share Document