nowadays, scheduling problems have a considerable application in production and service systems. in this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. in many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combinat...

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...

This study proposes an exact algorithm for the precedence-constrained singlemachine scheduling problem to minimize total job completion cost where machine idle time is forbidden. The proposed algorithm is an extension of the authors’ previous algorithms for the problem without precedence-constraints and is based on the SSDP (Successive Sublimation Dynamic Programming) method. Numerical experime...

In this paper, single machine scheduling problems with sequence dependent setup times are considered. The objective is to minimize the total weighted tardiness. The single machine total weighted tardiness (SMTWT) scheduling problems with sequence dependent setup times were proved to be strongly NP-hard. A recently developed meta-heuristic algorithm called as crow search algorithm is proposed to...

In this study, a conceptual framework is given for the dynamic multi-project scheduling problem with weighted earliness/tardiness costs (DRCMPSPWET) and a mathematical programming formulation of the problem is provided. In DRCMPSPWET, a project arrives on top of an existing project portfolio and a due date has to be quoted for the new project while keeping the costs related to changes in the sc...

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...

We consider the problem of determining the allocation of demand from different customer orders to production batches and the schedule of resulting batches to minimize the total weighted earliness and tardiness penalties in context of batch chemical processing. The problem is formulated as a mixed-integer nonlinear programming model. An iterative heuristic procedure that makes use of the network...

The single machine total weighted tardiness with release dates problem is known to be strongly NP-hard. With a new lower bounding scheme and a new upper bounding scheme, we get an efficient branch and bound algorithm. In the paper, we first introduce the history of the problem and its computational complexity. Second, the lower bounding schemes and the upper bounding schemes are described in de...

We address a complex scheduling problem arising in the wood panel industry with the objective of minimizing a quadratic function of job tardiness. The proposed solution strategy, which is based on an effective genetic algorithm, has been coded and implemented within a major Tunisian company, leader in the wood panel manufacturing. Preliminary experimental results indicate significant decrease o...

This paper considers the problem of linding an optimal schedule and a common due date for a set of jobs, in a static single machine system. The scheduling criterion is the minimization of the weighted sum of earliness and tardiness values. Different weights are considered as the earliness penalty and tardiness penalty, for each job. A branching procedure is presented for finding an optimal solu...