We investigate a common due-date assignment scheduling problem with a variable maintenance on a single machine. The goal is to minimize the total earliness, tardiness, and due-date cost. We derive some properties on an optimal solution for our problem. For a special case with identical jobs we propose an optimal polynomial time algorithm followed by a numerical example.

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.

we consider a functional equation that arises in problems of scheduling with priorities and earliness/lateness penalties. We solve the equation and note how it can be used to analyze the invariance of conclusions about optimality of a schedule if the scale used to measure priority is replaced by another acceptable scale. Keywords-Scheduling, Functional equations, Measurement theory, Penalty fun...

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

Due-dates are often determined during sales negotiations between customers and the sales team of the firm. In the preliminary (pre-sale) stage, the customer provides a time interval (due-window) of his preferred due-dates. This interval reflects acceptable leadtimes, which are functions of the customer resource constraints (e.g. storage or personnel limitations). If the due-dates are assigned e...

Cherimoya (Annona cherimola Mill.) is a subtropical tree crop that belongs to the Angiosperm family Annonaceae, which also includes sugar apple and soursop. Cherimoya flowers are pollinated by beetles and characterized by a marked protoginous dichogamy. In regions where cherimoya is now cultivated, the lack of native efficient pollinators forces the implementation of hand-pollination, thus incr...

W e consider multimachine scheduling problems with earliness and tardiness costs. We first analyze problems in which the cost of a job is given by a general nondecreasing, convex function F of the absolute deviation of its completion time from a (common) unrestrictive duedate, and the objective is to minimize the sum of the costs incurred for all N jobs. (A special case to which considerable at...

We study multitasking scheduling and due-window assignment problems in a single machine, which can be found various application domains. In environment, unfinished job always interrupts in-processing job. common due window assignment, the aim is to find optimal minimise value of earliness tardiness penalty. this paper, we two problems, where objective first problem earliness, tardiness, startin...