Combinatorial optimization problems are usually NP-hard and the solution space of them is very large. Therefore the set of feasible solutions cannot be evaluated one by one. Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO) and Genetic Algorithms (GA) are metaheuristic techniques...

Specific scheduling problems with complex hybrid logical and terminal constraints, non-stationarity in process execution as well as complex interrelations between dynamics in process design, capacity utilization, and machine setups require further investigation and the application of a broad...

We consider a production planning problem for a general jobshop producing a number of products and subject to breakdown and repair of machines. The machine capacities are modeled as Markov chains. The objective is to choose the rates of production of the final products and intermediate parts on...

We establish the computational complexity of the problem of minimizing makespan in a flowshop, where each jobs requires a pallet the entire time, from the start of its first operation until the completion of the last operation. We prove that the problem is NP-hard in the strong sense for m =2...

Inventory control is among the most important topics in operations research because of large investments in inventory and their effect on the profitability of the firms. A systematic analysis of inventory problems began with the development of the classical EOQ formula of Ford W. Harris in 1913,...

Cooperative advertising is a key incentive offered by a manufacturer to influence retailers' promotional decisions. We study cooperative advertising in a dynamic retail duopoly where a manufacturer sells his product through two competing retailers. We model the problem as a Stackelberg...