Scheduling problems in an open shop is more complicated than others since jobs do not follow a certain route in the system. This study uses computer simulation to compare the performance of different dispatching rules in an open shop. We find that the choice of the best dispatching rule is affected by the utilization factor, due-date factors, and the process time distribution at each station. I...

In this paper, we propose two efficient scheduling algorithms for the total exchange, which is a basic communication pattern used on the GRID environment. Both algorithms are used with the open shop algorithm. The first algorithm is a static scheduling algorithm which partitions messages before the open shop algorithm, and the second algorithm is a dynamic algorithm used in the execution of the...

The proposed hybrid stage shop scheduling (HSSS) model, inspired from a real case in the high-fashion industry, aims to fully exploit the potential of parallel resources, splitting and overlapping concurrent operations among teams of multifunctional machines and operators on the same job. The HSSS formally extends mixed shop scheduling (a combination of flowshop and open shop), which is able to...

Multi-objective open-shop scheduling is definitely significant in practical. However, the research focused on multi-objective open-shop scheduling was relatively scarce. This article proposed a particle swarm optimization to address open-shop scheduling problems with multiple objectives. Originally, particle swarm optimization was invented to treat continuous optimization problems. In this pape...

This paper addresses the open shop scheduling problem. this problem, due to its complexity, is ranked in the class of NPhard problems. In this case, traditional approaches cannot reach to an optimal solution in a reasonable time. So heuristic algorithms such as simulated Annealing (SA), tabu search (TS) genetic algorithm, (GA), ant colony optimization (ACO) used to solve optimization problems s...

This paper represents the metaheuristics proposed for solving a class of Shop Scheduling problem. The Bacterial Foraging Optimization algorithm is featured with Ant Colony Optimization algorithm and proposed as a natural inspired computing approach to solve the Mixed Shop Scheduling problem. The Mixed Shop is the combination of Job Shop, Flow Shop and Open Shop scheduling problems. The sample i...

We consider several combinatorial optimization problems which combine the classic shop scheduling problems, namely open shop scheduling or job shop scheduling, and the shortest path problem. The objective of the obtained problem is to select a subset of jobs that forms a feasible solution of the shortest path problem, and to execute the selected jobs on the open (or job) shop machines to minimi...

The concept of irreducibility in shop scheduling problems withdifferent objectives has proven one of the most fertile research topics as theset of all irreducible sequences in a given shop contains at least one optimalsequence for arbitrary processing times. Recently, a number of equivalent for-mulations of the reducibility in open-shop problem with Makespan objectivesare pr...