This paper presents an extended classification for non-permutation flowshops. The versatile options which occur with the possibility of resequencing jobs within the line are considered. The literature review shows that no classification exists which considers extensively this type of flowshop.

In this paper, we address the problem of two-machine flowshop scheduling problem with sequence independent setup times to minimize the total completion time. We propose five new polynomial lower bounds. Computational results based on randomly generated data show that our proposed lower bounds consistently outperform those of the literature.

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...

This paper deals with the permutation flowshop scheduling problem time lags constraints to minimize total weighted tardiness criterion by using Branch and Bound algorithm. A new lower bound was developed for problem. The computational experiments indicate that proposed algorithm provides good solution in terms of quality requirements.

The paper addresses the problem of scheduling in the two-stage flowshop with parallel unrelated machines and renewable resource constraints. The objective is minimization of makespan. The problem is NP-hard. Fast heuristic algorithms using list scheduling and greedy strategies are proposed. For evaluation of the performance of the algorithms computational experiments are performed on randomly g...

This article reports of two studies addressing the meaning of primary and secondary control beliefs for transition to modernity and modern adoles­ cents. Study 1 participants (N = 365) were Malaysian (transition to mod­ ernity), and German and North American (modern) adolescents. Study 2 participants (N = 757) were Israeli Druze (transition to modernity) and Israeli Jewish (modern) adolescents....

We give a graph theoretical proof for the existence of a walk connecting left and right sides of a rectangle when it is partitioned into (finitely many) rectangles colored in a specific way, and the walk is aloud to use only borders between rectangles of different color. The problem was originally introduced by J.R. Isbell in the proof of his Zig-Zag Theorem. We prove the existence of such a wa...

This paper studies the two-machine flowshop scheduling problem with anticipatory setup times and an availability constraint imposed on only one of the machines where interrupted jobs can resume their operations. We present two heuristics and show that their worst-case error bounds are no larger than 2/3.

We consider in this paper the two-machine flowshop scheduling problem with total tardiness minimization. We propose a genetic algorithm and a matheuristic algorithm. Some computational experiments are described and the results show that these methods outperform other existing methods based on truncated branch-and-bound algorithms. Some future research directions are given, both in terms of eval...