Resource Constrained Project Scheduling Problem (RCPSP) is the most general scheduling problem. Job shop scheduling, flow shop scheduling and other scheduling problems are the subsets of RCPSP. The present paper examines the multimode multi-objective resource constrained project scheduling problem (RCPSP) with partial precedence relations. To enhance the practical aspects of this prominent prob...

In this paper, mathematical models for permutation flow shop scheduling and job shop scheduling problems are proposed. The first problem is based on a mixed integer programming model. As the problem is NP-complete, this model can only be used for smaller instances where an optimal solution can be computed. For large instances, another model is proposed which is suitable for solving the problem ...

The quest for sustainability has arrived to the manufacturing world, with emergence of a research field known as green scheduling. Traditional performance objectives now co-exist energy-saving ones. In this work, we tackle job shop scheduling problem double goal minimising energy consumption during machine idle time and project’s makespan. We also consider uncertainty in processing times, model...

The Job Shop Scheduling Problem (JSSP) has enormous industrial applicability. This problem refers to a set of jobs that should be processed in specific order using machines. For the single-objective optimization JSSP problem, Simulated Annealing is among best algorithms. However, Multi-Objective (MOJSSP), these algorithms have barely been analyzed, and Threshold Accepting Algorithm not publishe...