This study considers the production of chemotherapy drugs for cancer treatment. An important factor determining quality service treatment is time patient must wait to receive his or her injection drug. Chemotherapy and delivery are modeled as a scheduling problem combined with vehicle routing problem. The three-stage hybrid flow shop problem, variant multi-trip due dates. objective function min...

We present a new dominance rule by considering the time-dependent orderings between each pair of jobs for the single machine total weighted tardiness problem with release dates. The proposed dominance rule provides a sucient condition for local optimality. Therefore, if any sequence violates the dominance rule then switching the violating jobs either lowers the total weighted tardiness or leav...

This paper addresses a hybrid flow shop scheduling problem with real-world constraints, and proposes a novel algorithm for its solution. We first discuss the distinguishing characteristics of nighttime and simultaneous work in the transformer manufacturing process. To solve the problem within a reasonable time, we propose a hybrid genetic algorithm. This algorithm combines the Nawaz–Enscore–Ham...

Production scheduling and preventive maintenance planning decisions are inter-dependent but most often made independently. Given that maintenance affects available production time and elapsed production time affects the probability of machine failure, this interdependency seems to be overlooked in the literature. We propose an integrated model that simultaneously determines production schedulin...

Grid computing facilitates the resource sharing through the administrative domains which are geographically distributed. Scheduling in a distributed heterogeneous environment is intrinsically very hard because of the heterogeneous nature of resource collection. Makespan and tardiness are two different measures of scheduling, and many of the previous researches concentrated much on reduction of ...

In this study, a tabu search (TS) approach to the single machine total weighted tardiness problem (SMTWT) is presented. The problem consists of a set of independent jobs with distinct processing times, weights and due dates to be scheduled on a single machine to minimize total weighted tardiness. The theoretical foundation of single machine scheduling with due date related objectives reveal tha...

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

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