Nowadays, several methods in production management mainly focus on the different partners of supply chain management. In real world, the capacity of planes is limited. In addition, the recent decade has seen the rapid development of controlling the uncertainty in the production scheduling configurations along with proposing novel solution approaches. This paper proposes a new mathematical model...

  This paper proposes two relax and fix heuristics for the simultaneous lot sizing and sequencing problem in permutation flow shops involving sequence-dependent setups and capacity constraints. To evaluate the effectiveness of mentioned heuristics, two lower bounds are developed and compared against the optimal solution. The results of heuristics are compared with the selected lower bound .

In this paper we have presented a combination of two metaheuristics, namely great deluge and tabu search, for solving the university course timetabling problem. This problem occurs during the assignment of a set of courses to specific timeslots and rooms within a working week and subject to a variety of hard and soft constraints. Essentially a set of hard constraints must be satisfied in order ...

The application of machine learning techniques in compiler frameworks has become a challenging research area. Learning algorithms are exploited for an automatic generation of optimization heuristics which often outperform hand-crafted models. Moreover, these automatic approaches can effectively tune the compilers’ heuristics after larger changes in the optimization sequence or they can be lever...

Principal to the ideology behind hyper-heuristic research is the desire to increase the level of generality of heuristic procedures so that they can be easily applied to a wide variety of problems to produce solutions of adequate quality within practical timescales. This thesis examines hyper-heuristics within a single problem domain, that of Bin Packing where the benefits to be gained from sel...

Hyper-heuristics are a class of high-level search techniques which operate on a search space of heuristics rather than directly on a search space of solutions. Early hyperheuristics focussed on selecting and applying a low-level heuristic at each stage of a search. Recent trends in hyper-heuristic research have led to a number of approaches being developed to automatically generate new heuristi...

Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...

In this paper, we consider the problem of scheduling n independent jobs on m uniform parallel machines such that total weighted completion time is minimized. We present two meta-heuristics and two hybrid meta-heuristics to solve this problem. Based on a set of instances, a comparative study has been realized in order to evaluate these approaches.

The Capacitated Lot-Sizing Problem (CLSP) and its variants are important challenging optimization problems. Constructive heuristics known to be the most intuitive fastest methods for finding good feasible solutions CLSPs therefore often used as a subroutine in building more sophisticated exact or metaheuristic approaches. Classical constructive heuristics, such period-by-period lot elimination ...