Fawaz S. Al-Anzi

Learn More
The assembly flowshop scheduling problem has been addressed recently in the literature. There are many problems that can be modeled as assembly flowshop scheduling problems including queries scheduling on distributed database systems and computer manufacturing. The problem has been addressed with respect to either makespan or total completion time criterion(More)
In this paper, we address the two-stage assembly flowshop scheduling problem with a weighted sum of makespan and mean completion time criteria, known as bicriteria. Since the problem is NP-hard, we propose heuristics to solve the problem. Specifically, we propose three heuristics; simulated annealing (SA), ant colony optimization (ACO), and self-adaptive(More)
In this paper, we present an extension of the classical Resource Constrained Project Scheduling Problem (RCPSP). We present a new type of resource constraints in which staff members are involved. We present a new model where staff members can have several skills with different proficiency, i.e., a staff member is able to perform more than one kind of(More)
⎯The two-stage flowshop scheduling problem with separate setup times to minimize maximum lateness is addressed in this paper. It is well known that this problem is strongly NP-hard and that there exists at least one optimal solution which is a permutation schedule. A polynomial hybrid genetic based algorithm is proposed to find an approximate solution to(More)