This paper is concerned with the problem of scheduling tasks on a system consisting of two parallel processors in order that makespan be minimized. In particular, we treat a variety of modifications to this basic theme, including the cases of identical, proportional, and unrelated processors. In...

This paper approximately solves the high school timetabling problem using a simulated annealing based algorithm with a newly-designed neighborhood structure. In search for the best neighbor, the heuristic performs a sequence of swaps between pairs of time slots, instead of swapping two...

The two-dimensional guillotine bin packing problem consists of packing, without overlap, small rectangular items into the smallest number of large rectangular bins where items are obtained via guillotine cuts. This problem is solved using a new guillotine bottom left (GBL) constructive heuristic...

We study the two-staged fixed orientation constrained two-dimensional two-staged cutting stock problem. We solve the problem using several approximate algorithms, that are mainly based upon a strip generation procedure (HESGA) already developed in ([13)]. We evaluate the performance of these...