This paper considers a non-identical parallel machine scheduling problem with sequence and machine dependent setup times. The objective of this problem is to determine the allocation of jobs and the scheduling of each machine to minimize makespan. A mathematical model for optimal solution is derived. An in-depth analysis of the model shows that it is very complicated and difficult to obtain opt...

In this work we present a metaheuristic method based on tabu search for solving the permutation flow shop scheduling problem with sequence dependent setup times, with the objective of minimizing total weighted tardiness. The problem is well known for its practical applications and for the difficulty in obtaining good solutions. The tabu search method proposed is based on the insertion neighborh...

Population based metaheuristics, such as hybrid genetic algorithms or memetic algorithms, play an important role in the solution of combinatorial optimization problems. The memetic algorithm presented here for the no-wait flowshop scheduling problem addresses a hierarchically organized complete ternary tree to represent the population that putted together with a recombination plan resembles a p...

In this paper, we consider a flowshop scheduling problem with sequence-dependent setup times and a bicriteria objective to minimize the work-in-process inventory for the producer and to maximize the customers’ service level. The use of a bicriteria objective is motivated by the fact that successful companies in today’s environment not only try to minimize their own cost but also try to fulfill ...

This paper studies the permutation flowshop scheduling problem with sequence dependent setup times and time lags constraints minimizing the number of tardy jobs. Dependent setup times are defined as the work to prepare the machines between two successive jobs. Time lags are defined as intervals of time that must exist between every couple of successive operations of the same job. Two mathematic...

This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates under the hypothesis of fuzzy processing time’s knowledge. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. At the end, the effectiveness of the pr...

We consider scheduling a single server in a multi-class queue subject to setup times and setup costs. We examine the issue of whether or not reductions in the mean and variance of the setup time distributions can lead to degraded system performance. Provided that setups are reduced according to a stochastically smaller ordering, we show that if an optimal policy is used both for the original sy...

The frequent changeovers in the production processes indicate the importance of setup time in many real-world manufacturing activities. The traditional approaches in dealing with setup times are that either to omit or to merge into the processing times so as to simplify the problems. These approaches could reduce the complexity of the problem, but often generated unrealistic outcomes because of...

in this paper, the researchers have investigated a concatenated robot move (crm) sequence problem and minimal part set (mps) schedule problem with different setup times for two-machine robotic cell. they have focused on simultaneous solving of crm sequence and mps schedule problems with different loading and unloading times. they have applied a simulated annealing (sa) algorithm to provide a go...

This paper introduces and compares several formulations of a production scheduling problem with sequence-dependent and time-dependent setup times on a single machine. The setup time is divided into two parts: one that can be performed at any time and another one that is restricted to be made outside of a given time interval. As a result, the setup time between two jobs is a function of the comp...