Due-date assignment and parallel-machine scheduling with deteriorating jobs

2007 ◽  
Vol 58 (8) ◽  
pp. 1103-1108 ◽  
Author(s):  
T C E Cheng ◽  
L Y Kang ◽  
C T Ng
Keyword(s):  
Deteriorating Jobs ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Due Date ◽  
Due Date Assignment

The Parallel Machine Scheduling with Considering the Due Date Assignment, Earliness, Weighted Number of Tardy Jobs and Batch Delivery

2021 ◽  
pp. 1-20
Author(s):  
M. B. Fakhrzad ◽  
Saber Shamsadini ◽  
Abbasali Jafari-Nodoushan
Keyword(s):  
Objective Function ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Due Date ◽  
Due Date Assignment ◽  
Number Of Tardy Jobs ◽  
Weighted Number ◽  
Vehicle Capacity ◽  
Tardy Jobs

In this paper, parallel machine scheduling problem is considered under due date assignment, earliness, weighted number of tardy jobs, facilities costs and shipping products by limited vehicle capacity. The orders of the customer are presented with a due date. Each order is scheduled and assigned to one of the machines according to due date, delay weight and penalty of increasing of due date and shipped in the batch. The problem is known as NP-hardness, therefore a Genetic Algorithm (GA) is proposed to solve the problem. The results are also compared with the CPLEX solver in the GAMS. Finally, sensitivity analysis for the problem parameters is performed in relation to the objective function. The results showed a direct relationship between objective function with the weighted tardiness and processing time, also an inverse relationship with the number of machines and vehicle capacity.

Unrelated Parallel-Machine Scheduling with Deteriorating Jobs and Rejection

2012 ◽  
Vol 263-266 ◽  
pp. 655-659 ◽  
Author(s):  
Chou Jung Hsu ◽  
Chia Wen Chang
Keyword(s):  
Completion Time ◽  
Deteriorating Jobs ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Unrelated Parallel Machine ◽  
Absolute Deviation ◽  
Total Load ◽  
Unrelated Parallel Machine Scheduling ◽  
Total Penalty

This paper aimed to investigate the unrelated parallel-machine scheduling with deteriorating jobs and rejection. The objective is to find the rejected jobs, the non-rejected jobs, and the optimal non-rejected job sequence so that the cost function that includes the weighted of total load, total completion time, and total absolute deviation of completion time plus the total penalty of the rejected jobs would be minimized. Results showed that the problem is polynomial time solvable when the number of machine is fixed.

Sign in / Sign up

Export Citation Format

Share Document