Permutation flowshop scheduling problem with sequence-dependent setup times (PFSP-SDST) and makespan minimisation is NP-hard. It has important practical applications, for example, in the cider industry print industry. There exist several metaheuristic algorithms to solve this problem. However, within time limits, those still either find low quality solutions or struggle large problems. In paper...

this paper explores the flexile flow lines where setup times are sequence- dependent. the optimization criterion is the minimization of total weighted completion time. we propose an iterated greedy algorithm (iga) to tackle the problem. an experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of iga are compared against those of some other exist...

In this study, we consider single-machine scheduling problems with past-sequence-dependent (denoted by psd) setup times in which the of jobs are proportional to length already processed jobs. Under common (CON) and slack (SLK) due-date assignment methods, prove that weighted sum earliness, tardiness minimization remains polynomially solvable. We also give some extensions for psd times.

In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...

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.

The study considers the scheduling problem of identical parallel machines subject to minimization of the maximumcompletion time and the maximum tardiness expressed in a linear convex objective function. The maximum completiontime or makespan is the date when the last job to be completed leaves the system. The maximum tardiness is indicated bythe job that is completed with the lo...

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