In the scheduling problem addressed in this note we have to determine: (i) the job sequence, (ii) the (common) due-date, and (iii) the location of a rate modifying (maintenance) activity. Jobs scheduled before (after) the due-date are penalized according to their earliness (tardiness) value. The processing time of a job scheduled after the maintenance activity decreases by a job-dependent facto...

The aim of this paper is to solve a problem on scheduling with earliness and tardiness costs using constraint programming approach, and to compare the results with the ones from the original timed automata approach. The case study, a production of lacquers, includes some real life features like operating hours or changeover times. Considering the earliness and tardiness costs of the case study,...

This paper focuses on a stochastic scheduling problem in which n immediately available jobs are to be scheduled jointly with the preventive maintenance in a single machine subject to breakdowns. The objective is to minimize expected total earliness and tardiness costs with a common due-date. The problem of scheduling only n jobs to minimize total earliness and tardiness costs in a single machin...

A novel algorithm for one machine scheduling to minimize total weighted earliness and tardiness using particle swarm optimization is proposed. Existing techniques face challenges such as job size limitations increase in computational time and inaccurate solutions. To overcome these challenges the proposed work implements Meta-Heuristic based particle swarm optimization to optimize the total wei...

While almost all existing works which optimally solve just-in-time scheduling problems propose dedicated algorithmic approaches, we in this work mixed integer formulations. We consider a single machine problem that aims at minimizing the weighted sum of earliness–tardiness penalties around common due date. Using natural variables, provide one compact formulation for unrestrictive case and, gene...

In this paper, we present dominance conditions for the single machine weighted earliness scheduling problem with no idle time. We also propose an algorithm that can be used to improve upper bounds for the weighted earliness criterion and lower bounds for an earliness/tardiness problem. The computational tests show that the algorithm is superior to an initial heuristic schedule and an existing a...

This paper considers the problem of scheduling a single machine, in which the objective function is to minimize the weighted quadratic earliness and tardiness penalties and no machine idle time is allowed. We develop a branch and bound algorithm involving the implementation of lower and upper bounding procedures as well as some dominance rules. The lower bound is designed based on a lagrangian ...

In this paper, we study the multi-machine scheduling problem with earliness and tardiness penalties and sequence dependent setup times. This problem can be decomposedinto two subproblems sequencing and timetabling. Sequencing focuses on assigning each job to a fixed machine and determine the job sequence on each machine. We call such assignment a semi-schedule. Timetabling focuses on finding an...

In this chapter the authors address a hybrid flow shop scheduling problem considering the minimization of the makespan in addition to the sum of earliness and tardiness penalties. This problem is proven to be NP-hard, and consequently the development of heuristic and meta-heuristic approaches to solve it is well justified. So, to deal with this problem, the authors propose a method which consis...

This paper deals with the SingleMachine Scheduling Problem with Earliness and Tardiness Penalties, considering distinct due windows and sequence-dependent setup time. Due to its complexity, an adaptive genetic algorithm is proposed for solving it. Many search operators are used to explore the solution space where the choice probability for each operator depends on the success in a previous sear...