We address the 3-Machine Assembly-Type Flowshop Scheduling Problem (3MAF). This problem is known to be NP-complete in the strong sense. We propose an exact branch and bound method based on a recursive enumeration of potential inputs and outputs of the machines. Using this algorithm, several large size instances have been solved to optimality.

This paper considers the two-stage flexible flowshop scheduling problem with availability constraints. We discuss the complexity and the approximability of the problem, and provide some approximation algorithms with finite and tight worst case performance bounds for some special cases of the problem.

This paper addresses the jobshop and the flowshop scheduling problems with minimum and maximum time lags. To solve this kind of problems, we propose adaptations of Climbing Discrepancy Search (CDS). We study various parameter settings. Computational experiments are provided to evaluate the propositions.

This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The objective is to minimize the makespan. Under the assumption that interrupted jobs can resume their operations, we present a polynomial-time approximation scheme (PTAS) for this problem.

In 1988, J.R. Faulkner has given a procedure to construct an octonion algebra on a finite dimensional unitary alternative algebra of degree three over a field K. Here we use a similar procedure to get a quaternion algebra. Then we obtain some conditions for these octonion and quaternion algebras to be split or division algebras. Then we consider the implications of the found conditions to the u...

Deadlock detection is one of the most discussed problems in the literature. Although several algorithms have been proposed, the problem is still open. In general, the correct operation of an algorithm depends on the requirement model being considered. This article introduces a deadlockdetection algorithm for the OR model. The algorithm is complete, because it detects all deadlocks, and it is co...