Allocation of specific cutting plans and their scheduling to individual cutting machines presents a combinatorial optimization problem. In this respect, various approaches and methods are used to arrive to a viable solution. The paper reports three approaches represented by three discreet...

As globalisation and international sourcing prevail, constructing an optimal combination of diverse suppliers has become of great importance for meeting measurable objectives, such as on-time delivery, cost efficiency and risk mitigation. This paper presents a method for solving a sealed-bid,...

This contribution introduces a mixed-integer programming formulation for the multi-level, multi-machine proportional lot sizing and scheduling problem. It also presents a genetic algorithm to solve that problem. The efficiency of that algorithm is due to an encoding of solutions which uses a...

Cellular automata were used to model and to simulate phenomena in the area of physics, biology and medicine. In this paper it is now shown how the idea of cellular automata can be applied to optimization problems as well. As an example a cellular automaton is used as a basis for solving...

This paper aims to minimise the makespan of a set of identical batch processing machines in parallel. The batch processing machine can process a batch of jobs as long as the total size of all the jobs in the batch does not exceed its capacity. The processing time of the job and its size are...

An automated model is developed to support the optimization of the planning and scheduling of repetitive construction projects. The model provides the capability of optimizing two important objectives commonly sought in scheduling repetitive construction projects: minimizing project duration;...

In this paper, we consider the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. We propose a genetic approach based on a random key alphabet, and present several algorithms based on this approach. These versions differ on the generation of...

In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We propose a genetic approach based on a random key alphabet. Several genetic algorithms based on this approach are presented. These versions differ on...

This paper aims to minimise the makespan of a set of identical batch processing machines in parallel. The batch processing machine can process a batch of jobs as long as the total size of all the jobs in the batch does not exceed its capacity. The processing time of the job and its size are...