Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review

2020 ◽  
Vol 149 ◽  
pp. 106803
Author(s):  
Gustavo Alencar Rolim ◽  
Marcelo Seido Nagano
Keyword(s):  
Structural Properties ◽  
Due Dates ◽  
Earliness And Tardiness

USING GENETIC ALGORITHMS TO SOLVE FUZZY FLOW SHOP SCHEDULING PROBLEMS BASED ON POSSIBILITY AND NECESSITY MEASURES

2008 ◽  
Vol 16 (03) ◽  
pp. 409-433 ◽  
Author(s):  
PENG-JEN LAI ◽  
HSIEN-CHUNG WU
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Fuzzy Sets Theory ◽  
Scheduling Problems ◽  
Due Dates ◽  
Objective Functions ◽  
Earliness And Tardiness ◽  
Processing Times ◽  
Fuzzy Processing Times ◽  
Sets Theory

The scheduling problems with fuzzy processing times and fuzzy due dates are investigated in this paper. The concepts of earliness and tardiness are interpreted by using the concepts of possibility and necessity measures that were developed in fuzzy sets theory. Many types of objective function will be taken into account through the different combinations of possibility and necessity measures. The purpose of this paper is to obtain the optimal schedules based on these objective functions. The genetic algorithm will be invoked to tackle these objective functions. Four numerical examples are also provided and solved by using the commercial software MATLAB.

Single Machine Multiple Common due Dates Assignment Based on Common Flow Allowance and Resource-Dependent Processing Times

2014 ◽  
Vol 644-650 ◽  
pp. 2022-2025
Author(s):  
Cheng Xin Luo ◽  
En Min Feng
Keyword(s):  
Single Machine ◽  
Optimal Algorithm ◽  
Due Dates ◽  
Due Date ◽  
Earliness And Tardiness ◽  
Processing Times ◽  
Resource Cost ◽  
The Common ◽  
Resource Allocation Scheme ◽  
Flow Allowance

This paper studies a multiple common due date assignment problem on a single machine. The job-dependent due dates are obtained based on common flow allowance criteria. We assume that the processing time of a job is controllable by the resource amount assigned to it. The objective is to find the optimal multiple common dues, the set of jobs assigned to each due date, the sequence of jobs and resource allocation scheme to minimize a total cost based on earliness and tardiness of jobs, the common dues and resource cost. We propose an optimal algorithm to solve the problem.

Stochastic Sequencing on One Machine with Earliness and Tardiness Penalties

1993 ◽  
Vol 7 (2) ◽  
pp. 291-300 ◽  
Author(s):  
Frank G. Forst
Keyword(s):  
Random Variables ◽  
Independent Random Variables ◽  
Due Dates ◽  
Due Date ◽  
Earliness And Tardiness ◽  
Processing Times ◽  
One Machine ◽  
Job Tardiness ◽  
Independent And Identically Distributed

In this paper the objective is to find a job sequence that minimizes, stochastically or in expectation, the sum of the total weighted job earliness and the total weighted job tardiness on one machine, when the job processing times are independent and identically distributed random variables. We first derive results for the case in which the jobs share a common, random due date. We then obtain results when the job due dates are distinct, independent random variables.

Sign in / Sign up

Export Citation Format

Share Document