This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search approaches for these problems has focused on developing problem specific constraint propagators and ordering heuristics. Indeed, the common belief is that many of these problems are too difficult to solve without such do...

A new hybrid flow shop scheduling problem with blocking is studied. The problem is characterized by multistage unrelated parallel machines and no intermediate buffer. Firstly, the math model of the hybrid scheduling problem is constructed. And then the computation method of production period is given. Due to there is no intermediate buffer, and there are unrelated parallel machines in multi-sta...

The work described in this paper attempts to validate the implicit assumption in traditional flow shop scheduling research that there is a buffer of infinite capacity between any two adjacent machines. The modified NEH (Nawaz, Encore and Ham) algorithm is used to generate an initial permutation schedule which is then improved by tabu search. For any given sequence, a limited equal buffer size i...

The use of appropriate inventory control policies is a must in production systems. Production systems are characterised by structural and dynamic complexity. Material and information delays can occur, which may lead to inventory oscillations. In order to handle these dynamics, a system dynamics approach is used. It encompasses inventory control policies on the flow shop, the production network ...

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

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

In this paper we consider a job shop scheduling problem with blocking (zero buffer) constraints. Blocking constraints model the absence of buffers, whereas in the traditional job shop scheduling model buffers have infinite capacity. There are two known variants of this problem, namely the blocking job shop scheduling (BJSS) with swap allowed and the BJSS with no-swap. A swap is needed when ther...