In this paper we compare simulated annealing and tabu search approaches to a single machine common due date assignment and scheduling problem with jobs available at different times. The objective is to minimize the total weighted sum of earliness, tardiness and due date costs.

The paper presents the methodology of parallel algorithm designing based on the memetic approach (Lamarck and Baldwin evolution theory) making use of specific properties of the problem and distributed island model. This approach is presented on the example of the single machine scheduling problem with earliness/tardiness

This paper describes a genetic algorithm approach to the dynamic job shop scheduling problem with jobs arriving continually. Both deterministic and stochastic models of the dynamic problem were investigated. The objective functions examined were weighted flow time, maximum tardiness, weighted tardiness, weighted lateness, weighted number of tardy jobs, and weighted earliness plus weighted tardi...

Single machine, distinct due dates, early/lately machine problem and fuzzy environment closely models the situation faced by ‘Just In Time’ manufacturing. The objective of this paper is to sequence the jobs on the machine, so that the total penalty cost be minimum. This cost is composed of the total earliness and the total tardiness cost. An algorithm is developed here to minimize the total pen...

A fully polynomial time approximation scheme (FPTAS) with run time O( n m εm−1 ) is developed for a problem which combines common due window assignment and scheduling n jobs on m identical parallel machines. The problem criterion is bottleneck (min-max) such that the maximum cost, which includes job earliness, job tardiness and due window size costs, is minimized.

We consider a single machine earliness/tardiness scheduling problem with general weights, ready times and due dates. Using completion time information obtained from the optimal solution to a preemptive relaxation, we generate feasible solutions to the original non-preemptive problem. We report extensive computational results demonstrating the speed and effectiveness of this approach.

  In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...

There are many situations when, due to unexpected delays, the supplier may not be able to deliver some orders by the promised due dates. We present a model for quoting attainable delivery times to minimize tardiness penalties and delivery costs, when deliveries take place in batches. We show that the general problem is strongly NPhard, but when all orders have the same per-unit due-dateassignme...