In this paper, a comparison and validation of various priority rules for the job shop scheduling problem under different objective functions is made.<br> In a first computational experiment, 30 priority rules from literature are used to schedule job shop problems under two flow time-related and...

In this paper, a new procedure to solve a job shop scheduling problem at a Belgian manufacturer producing industrial wheels and castors in rubber is presented. The procedure is an extension of a hybrid shifting bottleneck procedure with a tabu search algorithm while incorporating various company...

This paper presents a genetic algorithm and a scatter search procedure to solve the well-known job shop scheduling problem. In contrast to the single population search performed by the genetic algorithm, the scatter search algorithm splits the population of solutions in a diverse and...

In this paper, an Invasive Weed Optimization (IWO) algorithm for the Resource Availability Cost Problem (RACP) is presented, in which the total cost of the (unlim- ited) renewable resources required to complete the project by a pre-specified project deadline should be minimized. The IWO...

Learning effects assume that the efficiency of a resource increases with the duration of a task. Although these effects are commonly used in machine scheduling environments, they are rarely used in a project scheduling setting. In this paper, we study and model learning effects in a project...