The work presented in this article generalizes the modeling of task scheduling problems with sequence dependent setup time on the basis of task scheduling on single respectively exclusive resources: Besides working activities also work breaks are respected properly which is formally proven. The additional contribution of this article is an effective pruning algorithm according to the presented ...

Abstract This paper deals with a reentrant hybrid flow shop problem sequence-dependent setup time and limited buffers where there are multiple unrelated parallel machines at each stage. A mathematical model the minimization of total weighted completion is constructed for this problem. Considering complexity hand, an effective cooperative adaptive genetic algorithm (CAGA) proposed. In algorithm,...

The problem addressed in this paper is scheduling jobs on unrelated parallel machines with sequence-dependent setup times to minimize the maximum completion time (i.e., the makespan). This problem is NP-hard even without including setup times. Adding sequence-dependent setup times adds another dimension of complexity to the problem and obtaining optimal solutions becomes very difficult especial...

Domain filtering is a powerful technique for reduction of the search space during solving combinatorial problems like scheduling. In this paper we present several filtering algorithms designed specifically for scheduling in batch processing environments with sequence dependent setup times. We extend two known algorithms, namely edge finding and not-first/not-last technique, and we present a new...

much investigation has been given to this issue, the role of setup savings from the perspective of the workload control concept has hardly received attention. This paper reports a simulation study on this matter. The study evaluates the potential for savings in setups, dependent on the level of workload in the shop, for two alternative strategies, namely considering setup times centrally, withi...

In this paper a multicriteria scheduling problem with sequence-dependent setup times on a single machine is considered. The objective function of the problem is minimization of the weighted sum of total completion time, maximum tardiness and maximum earliness. An integer programming model is developed for the problem which belongs to NP-hard class. Only small size problems with up to 12 jobs ca...

This paper focuses on the flow shop sequence dependent group scheduling (FSDGS) problem with minimisation of total completion time as the criterion (Fm|fmls, prmu, Splk|∑Cj). The research problem is formulated in form of two different mixed integer linear programming (MILP) models. Comparing with the latest MILP model for the proposed problem in the literature, the complexity size of the propos...

Alternative IP formulations for scheduling flexible flowlines with sequence-dependent setup times will be presented. While one does not differentiate between the machines at each stage, the other does. The differences in the formulations based on ease of implementation and ease of extension to variants of the problem will be discussed.