We consider the problem of scheduling a number of jobs, each job having a release time, a processing time, a due date and a family setup time, on a single machine with the objective of minimizing the maximum lateness. We develop a hybrid genetic algorithm and validate its performance on a newly...

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...

The scheduling of projects has gained increasing attention since the introduction of PERT and CPM. Both the scheduling literature and the software scheduling packages rely on (meta-)heuristic and exact procedures to schedule projects under various assumptions. However, there is still room for...

In this paper, an Integer Programming (IP) model is presented to assign MBA and undergraduate students to groups to solve an exam case in an “Operations Research (O.R.)” course. It is assumed that the students have a basic understanding of mathematical programming, and are now ready to build...

We consider the problem of scheduling a number of jobs, each job having a release time, a processing time and a due date, on a single machine with the objective of minimizing the maximum lateness or tardiness. This problem often occurs as a sub-problem in solving other scheduling environments...

This paper reports on a new solution approach for the well-known multi-mode resource-constrained project scheduling problem (MMRCPSP). This problem type aims at the selection of a single activity mode from a set of available modes in order to construct a precedence and a (renewable and...