The flow shop scheduling problem consists in the assignment of a set of jobs J = {J1, . . . , Jn}, each of which consists of a set of operations Jj = {Oj1, . . . , Ojoj} onto a set of machines M = {M1, . . . ,Mm} [5, 18]. Each operation Ojk is processed by at most one machine at a time, involving a non-negative processing time pjk. The result of the problem resolution is a schedule x, defining ...

This paper considers an integrated routing and scheduling problem where the part takes into account costs tardiness penalties is modelled by a permutation flow shop with inventory costs. We assume that each batch served dedicated vehicle, number of batches their compositions (the jobs parameters those jobs) are known in advance. The to determine starting times on machine shop, departure dates d...

In this paper it is presented an improvement of the branch and bound algorithm for permutation flow shop problem with blocking-in-process setup times objective minimizing total time tardiness, which known to be NP-Hard when there are two or more machines involved. With that in mind, a new machine-based lower exploits some structural properties problem. A database 27 classes problems, varying nu...

Though many techniques were proposed for the optimization of Permutation Flow-Shop Scheduling Problem (PFSSP), current only provide a single optimal schedule. Therefore, new algorithm is proposed, by combining k-means clustering and Genetic Algorithm (GA), multimodal PFSSP. In algorithm, first utilized to cluster individuals every generation into different clusters, based on some machine-sequen...

The job shop scheduling problem (JSSP) has attracted much attention in the field of both information sciences and operations research. This paper considers the permutation Job shop scheduling problem with the objective of minimizing make span. Artificial Bee Colony algorithm (ABC) is one of the search heuristics used to solve global optimization problems in complex search spaces. It is observed...