This paper presents several local search meta-heuristics for the problem of scheduling a single machine to minimise total weighted tardiness. A genetic algorithm for the static single machine total weighted tardiness problem is presented, and a multi-start version named metaGA is proposed. The obtained computational results permit to conclude about their efficiency and effectiveness. The resolu...

Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...

In this article, we consider the minimization of the total tardiness in a flexible job-shop. In our knowledge, this criterion is not previously studied for this type of shop configuration. The total tardiness criterion was mainly considered in the single machine problem (Chu [Chu92] and Souissi et al. [SKC04]). Few references studied this criterion in a job-shop configuration. The priority rule...

in this paper, a multi-product single machine scheduling problem with the possibility of producing defected jobs, is considered. we concern rework in the scheduling environment and propose a mixed-integer programming (mip) model for the problem.  based on the philosophy of just-in-time production, minimization of the sum of earliness and tardiness costs is taken into account as the objective fu...

Scheduling problems involving both earliness and tardiness costs became more important in recent years. This kind of problems include both earliness and tardiness penalties and tries to reduce them. In this study a case study from real world is investigated. Since the machine is bottle neck in the production line and all jobs have a common restrictive due date and different earliness and tardin...

The objective of this paper is to propose a scheduling problem for multiple automated guided vehicles (AGVs) in a manufacturing system. Considering the due date of AGVs requiring for material handling among shops in a job shop layout, their earliness and tardiness are significant in satisfying the expected cycle time and from an economic view point. Earliness results in AGVs waiting and tardine...

Two optimal algorithms, MTA* and MT-RBA*, are presented to find the optimal yard crane (YC) job sequence for serving a fleet of vehicles for delivery and pickup jobs with scheduled deadlines and predicted vehicle arrival times. The objective is to minimize the total tardiness of incoming vehicle jobs. This is important for minimizing vessel turnaround time. In the search for an optimal job sequ...

Quality control lead times are one of most significant causes of loss of time in the pharmaceutical and cosmetics industries. This is partly due to the organization of laboratories that feature parallel multipurpose machines for chromatographic analyses. The testing process requires long setup times and operators are needed to launch the process. The various controls are non-preemptive and are ...

In this paper we study the resource-constrained project scheduling problem with weighted earliness-tardiness penalty costs. Project activities are assumed to have a known deterministic due date, a unit earliness as well as a unit tardiness penalty cost and constant renewable resource requirements. The objective is to schedule the activities in order to minimize the total weighted earliness-tard...

Two single machine scheduling problems with fuzzy processing times and fuzzy due dates are considered. In both we define the fuzzy tardiness of a job in a given sequence as a fuzzy maximum of zero and the difference between the fuzzy completion time and the fuzzy due date of this job. In the first problem we minimize the maximal expected value of a fuzzy tardiness and in the second we minimize ...