In this paper we present a new Discrete Particle Swarm Optimization (DPSO) approach to face the NP-hard single machine total weighted tardiness scheduling problem in presence of sequence-dependent setup times. Differently from previous approaches the proposed DPSO uses a discrete model both for particle position and velocity and a coherent sequence metric. We tested the proposed DPSO mainly ove...

In this paper, we consider the single machine earliness/tardiness scheduling problem with di/erent release dates and no unforced idle time. The problem is decomposed into weighted earliness and weighted tardiness subproblems. Lower bounding procedures are proposed for each of these subproblems, and the lower bound for the original problem is the sum of the lower bounds for the two subproblems. ...

0377-2217/$ see front matter 2011 Elsevier B.V. A doi:10.1016/j.ejor.2011.10.020 ⇑ Corresponding author. Tel.: +43 732 2468 9466. E-mail address: [email protected] (R. Braune). In this paper, we propose an exact solution method for single machine scheduling problems typically arising from bottleneck-based decomposition of weighted tardiness job shops. The encountered subproblems are characte...

In this paper we consider the single-machine setup times scheduling with general effects of deterioration and learning. By the general effects of deterioration and learning, we mean that the actual job processing time is a general function of the processing times of the jobs already processed and its scheduled position. The setup times are proportional to the length of the already processed job...

We study the scheduling situation in which a set of jobs subjected to release dates and deadlines are to be performed on a single machine. The objective is to minimize a piecewise linear objective function ∑ j Fj where Fj(Cj) corresponds to the cost of the completion of job j at time Cj . This class of function is very large and thus interesting both from a theoretical and practical point of vi...

Although Particle Swarm Optimizers (PSO) have been successfully used in a wide variety of continuous optimization problems, their use has not been as widespread in discrete optimization problems, particularly when adopting non-binary encodings. In this chapter, we discuss three PSO variants (which are applied on a specific scheduling problem: the Single Machine Total Weighted Tardiness): a Hybr...

FACULTY OF SOCIAL, HUMAN AND MATHEMATICAL SCIENCES Mathematical Sciences Doctor of Philosophy THE VEHICLE ROUTING PROBLEM WITH RELEASE AND DUE DATES: FORMULATIONS, HEURISTICS AND LOWER BOUNDS Benjamin C. Shelbourne A novel extension of the classical vehicle routing and scheduling problem is proposed that integrates aspects of machine scheduling into vehicle routing. Associated to each customer ...

This paper considers the SLK/DIF due window assignment problems on a single machine with general job-dependent positional effect, where actual processing time of job is subject to and effect. Production schedulers may decide outsource/reject some jobs by paying corresponding costs. Based whether accept tardiness jobs, we consider two different objectives under slack assignment, respectively. Th...

This study considers the job scheduling problem of minimizing the Weighted Waiting Time Variance (WWTV) of jobs. It is an extension of WTV minimization problems in which we schedule a batch of n jobs, for servicing on a single resource, in such a way that the variance of their waiting times is minimized. WWTV minimization finds its applications for job scheduling in manufacturing systems with e...

This study considers the job scheduling problem of minimizing the weighted waiting time variance (WWTV) of jobs. It is an extension of WTV minimization problems in which we schedule a batch of n jobs, for servicing on a single resource, in such a way that the variance of their waiting times is minimized. WWTV minimization finds its applications for job scheduling in manufacturing systems with e...