We consider the problem of scheduling of n jobs to minimize the total earliness and tardiness penalty. The scheduling objective is to minimize the sum of job dependent earliness and tardiness penalties.. After determining the scheduling for single machine common due date, using neural network, the result shows that the neural network solution performs very well.

Due to the rapid growth of air transport traffic, how to efficiently allocate gates at airports to incoming or outgoing flights has become one of the most important problems which managers of airlines and airports have to concern about. The problem, which can be modeled as a scheduling problem, is often referred to as flight gate scheduling. The main purpose of flight gate scheduling is to find...

In this paper the multiple projects resourceconstrained project scheduling problem is considered. Several projects are to be scheduled simultaneously with sharing several kinds of limited resources in this problem. Each project contains non-preemptive and deterministic duration activities which compete limited resources under resources and precedence constraints. Moreover, there are the due dat...

This paper deals with a common due date parallel machines scheduling problem in which each job has a different tardiness penalty. The objective is to minimize the total weighted tardiness. The scheduling problem of minimizing the total weighted tardiness with a common due date on a single machine is known to be ordinary NP-hard. This is also the case for problem Pm|di = d| ∑ wiTi. A new dynamic...

When firms operate in a make-to-order environment, they must set due dates (or lead times) which are both relatively soon in the future and can be met reliably in order to compete effectively. This can be a difficult task, since there is clearly an inherent tradeoff between short due dates, and due dates that can be easily met. Nevertheless, the vast majority of due date scheduling research ass...

This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...