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)
The rapid development in Information and Communication Technology has had a significant impact on traditional educational systems and learning. Today, E-Learning has become a widely accepted way of learning. With increasing numbers of users, a wide range of learning services and the growth of educational content, E-Learning has emerged as the mode for(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)
Consider a connected directed graph G = (V; E), where V is the set of n nodes, and E is the set of e edges. A path from node v0 to node vk in G is an alternating sequence of nodes and edges that belong to V and E, respectively. Two nodes v and w in G are path equivalent if there is a path from v to w and a path from w to v. Path equivalence partitions V(More)