This paper presents a genetic algorithm (GA) for solving a generalized model of single-item resource-constrained aggregate production planning (APP) with linear cost functions. APP belongs to a class of pro-duction planning problems in which there is a single production variable representing the total production of all products. We linearize a linear mixed-integer model of APP subject to hiring...

In this paper, the problem of finding an assignment “n” surgeries to be presented in one “m” identical operating rooms (ORs) or machines as surgical case scheduling (SCSP) is proposed. Since ORs are among NP-hard optimization problems, mathematical and metaheuristic methods address OR problems used. The job operation ordering any a permanent part all sequencing problems. transportation times be...

In this paper, a closed-loop location-inventory problem for spare parts is presented. The proposed supply chain network includes two echelons, namely (1) distribution centers (DCs) and repairing centers (RCs) and (2) operational bases. Multiple spare parts are distributed among operational bases from distribution centers in the forward supply chain and failed spare parts from operational bases ...

While the 1980s were focused on the solution of large sized \easy" knapsack problems , this decade has brought several new algorithms, which are able to solve \hard" large sized instances. We will give an overview of the recent techniques for solving hard knapsack problems, with special emphasis on the addition of cardinality constraints , dynamic programming, and rudimentary divisibility. Comp...

Games often are inherently multi-valued problems and their wide variety offers different graduations of complexity. Moreover a lot of games have a parameter, like boardsize that allows to generate differently sized instances of the same problem. All this makes them perfectly suitable for benchmarking in the multi-valued domain. So far the lack of benchmarks in this area often was compensated by...

While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...

 This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...

While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...