Bicriteria scheduling for due date assignment with total weighted tardiness

2018 ◽  
Vol 52 (2) ◽  
pp. 359-370
Author(s):  
Hao Lin ◽  
Cheng He ◽  
Yixun Lin
Keyword(s):  
Performance Criterion ◽  
Total Weighted Tardiness ◽  
Due Date ◽  
Due Date Assignment ◽  
Bicriteria Scheduling ◽  
Weighted Tardiness ◽  
Polynomial Time Algorithms ◽  
Weighted Number ◽  
Tardy Jobs ◽  
Scheduling Models

In the due date assignment, the bicriteria scheduling models are motivated by the trade-off between the due date assignment cost and a performance criterion of the scheduling system. The bicriteria scheduling models related to the maximum tardiness and the weighted number of tardy jobs have been studied in the literature. In this paper we consider a new model with criteria of the due date assignment cost and the total weighted tardiness. The main results are polynomial-time algorithms for the linear combination version, the constraint version, and the Pareto optimization version of bicriteria scheduling.

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.

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.

Simulation Modelling and Analysis of Due Date Assignment Methods and Scheduling Decision Rules in a Flexible Manufacturing System

2021 ◽  
Vol 106 ◽  
pp. 99-108
Author(s):  
V.V. Muhammed Anees ◽  
K.P. Abdul Nazar ◽  
R. Sridharan
Keyword(s):  
Standard Deviation ◽  
Flexible Manufacturing ◽  
Manufacturing System ◽  
Flexible Manufacturing System ◽  
Decision Rules ◽  
Flow Time ◽  
Mean Flow ◽  
Due Date ◽  
Due Date Assignment ◽  
Tardy Jobs

This paper presents the salient details of a simulation-based study conducted to analyze the effect of due date assignment methods and scheduling decision rules on the performance of a flexible manufacturing system. A typical FMS is considered for investigation in the present study. Three endogenous due date setting methods and one exogenous method are examined in the present study. The scheduling rules considered for experimentation include processing time based rules and due date based rules in addition to the unbiased first-in-first-out rule. The performance measures evaluated in the present study are mean flow time, standard deviation of flow time, mean tardiness, standard deviation of tardiness, percentage of tardy jobs and average flow allowance. Analysis of the simulation results reveal that the dynamic due date setting methods provide better system performance.

Sign in / Sign up

Export Citation Format

Share Document