A novel scheduling problem that results from the addition of resource-assignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequencedependent setup times. The new characteristic is that the amount of setup time does not only depend on the machine and job sequence but also on the amount of resources assigned, which can vary between a...

Although many papers deal with the permutation flowshop scheduling problem with or without setups, according to our knowledge, little has been published tackling multi-objective optimization in presence of sequence dependent setup times. Hence, in this work we cope with this problem considering two pairs of well known independent objectives, the Cmax−TWT (Makespan-Total Weighted Tardiness ) and...

This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...

The recent survey paper “A Survey on Scheduling Problems with Setup Times and Costs” 1 , classifies batch scheduling problems into those with batching and nonbatching considerations, with sequence-independent and sequence-dependent setup times, and according to the machine environment and the objective function. The survey contains approximately 300 references, a clear indication of the importa...

In this paper, we propose different local search algorithms to solve a realistic variant of the flowshop problem. The variant considered here is a hybrid flexible flowshop problem with sequence-dependent setup times, and with the objective of minimizing the total tardiness. In this variant of flowshop, stage skipping might occur, i.e., not all stages must be visited by all jobs. This scheduling...

The Single Machine Scheduling (SMS) problem is one of the most representative problems in the scheduling area. In this paper, we explore the SMS with time constraints (setup times and due-dates) and the objective function is the minimization of total tardiness. The chosen method is based on a hybrid-genetic algorithm, which belongs to the memetic algorithms class. Results are compared against g...

Classically, scheduling research in artificial intelligence has concentrated on the combinatorial challenges arising in a large, static domain where the set of jobs, resource capacities, and other problem parameters are known with certainty and do not change. In contrast, queueing theory has focused primarily on the stochastic arrival and resource requirements of new jobs, de-emphasizing the co...

Flexible job shops are characterized by the existence of alternative –not necessarily identicalmachines, which permits parts to have different alternative routes in the shop. In a dynamic scheduling situation in which jobs continuously arrive over time, part routing rules are needed to deal with such routing flexibility as much as sequencing rules which define the order by which parts are admit...

The broad applications of cellular manufacturing make flowline manufacturing cell scheduling problems with sequence dependent family setup times a core topic in the field of scheduling. Due to computational complexity, almost all published studies focus on using permutation schedules to deal with this problem. To explore the potential effectiveness of treating this argument using non-permutatio...