A constraint propagation (filtering) turned out to be an efficient method how to reduce search space for backtrack-based algorithms. This paper brings several improvements of filtering methods for batch processing with sequence dependent setup times. The first one is domain filtering based on a precedence graph—such filtering can be useful even when no precedences are given at the start. I desc...

We consider the problem of allocating a single server to families of jobs with random service times and due dates. Furthermore, a setup is required when the server switches from one job family to another. We address the problems of minimizing expected weighted ow time, expected maximum lateness, and total weighted tardiness with emphasis on problems for which it is assumed that each family can ...

In this paper, a scheduling problem is considered which arises in the packaging industry. Plastic and foil wrappers used for packaging candy bars, crisps and other snacks typically require overlay printing with multiple colours. Printing machines used for this purpose usually accommodate a small number of colours which are loaded into a magazine simultaneously. If two consecutively scheduled pr...

In this paper, we tackle pipeline workflow applications that are executed on a distributed platform with setup times. In such applications, several computation stages are interconnected as a linear application graph, and each stage holds a buffer of limited size where intermediate results are stored and a processor setup time occurs when passing from one stage to another. The considered stage/p...

This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search methods mixed with local search principles, dominance conditions and specific lower bounds are proposed. The proposed methods are evaluated on a set of randomly generated instances and compared with previous results from ...

Abstract This paper addresses the unrelated parallel machine scheduling problem with sequence and dependent setup times eligibility constraints. The objective is to minimize maximum completion time (makespan). Instances of more than 500 jobs 50 machines are not uncommon in industry. Such large instances become increasingly challenging provide high-quality solutions within limited amount computa...

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

Job shop scheduling problems occurs in automobile industry, aerospace industry, printing industry, and chemical industry. Job shop scheduling problems are real world and complex. The present work assesses the effect of change in setup times levels on make span, maximum flow time and maximum tardiness measures. The model of the job shop is developed in PROMODEL simulation software. Three levels ...

This paper presents a branch-and-bound (B&B) algorithm for minimizing the sum of completion times in a singlemachine scheduling setting with sequence-dependent family setup times. The main feature of the B&B algorithm is a new lower bounding scheme that is based on a network formulation of the problem. With extensive computational tests, we demonstrate that the B&B algorithm can solve problems ...

Several researches on scheduling problems have been done under the assumption that setup times are independent of job sequence. However, in certain contexts, such as the pharmaceutical industry, metallurgical production, electronics and automotive manufacturing, there are frequently setup times on equipment between two different activities. In a survey of industrial schedulers, Dudek et al. (19...