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

In this study, we consider a particular version of the hybrid flexible flow shop (HFFS) scheduling problem, inspired from real-life application in printing industry. The considered problem is variation classical Flow which specific constraints are jointly considered, such as non-identical parallel machines, sequence-dependent setups on machine eligibility, and precedence among jobs, order to mi...

This paper deals with the problem of scheduling jobs in a parallel flow shop environment without buffers between machines and sequence-dependent setup times order to minimize maximum completion time jobs. The blocking constraint normally leads an increase due blockage machines, which can even more so when are considerable. Hence, heuristic solve this must take into account these specificities t...

Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...

The flowshop problem (FSP) is one of the most thoroughly studied scheduling problems. In the FSP, a set N = {1, . . . , n} of n independent jobs has to be processed on a set M = {1, . . . ,m} of m machines. Every job j, j ∈ N , requires a given fixed, non-negative processing time pij on every machine i, i ∈ M . In a flowshop, all n jobs are to be processed on the m machines in the same order, t...