location-allocation is a combinatorial optimization problem, and is defined as non deterministic polynomial hard (np) hard optimization. therefore, solution of such a problem should be shifted from exact to heuristic or meta heuristic due to the complexity of the problem. locating medical centers and allocating injuries of an earthquake to them has high importance in earthquake disaster managem...

This paper considers a dairy industry problem on integrated planning and scheduling of set yoghurt production. A mixed integer linear programming formulation is introduced to integrate tactical and operational decisions and a heuristic approach is proposed to decompose time buckets of the decisions. The decomposition heuristic improves computational efficiency by solving big bucket planning and...

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...

In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.

In this paper we model production problems where yields are stochastic, demands are substitutable, and several items are jointly produced. We have formulated this problem as a profit maximizing convex program, and have studied two solution procedures. The first method solves finite horizon stochastic programs on a rolling horizon basis. We have developed a decomposition algorithm for solving th...

− This paper presents an approach to model and optimize the activities of a manufacturing workstation based on a Petri structure. To model the workstation activities a comprehensive hierarchical task decomposition consistent with manufacturing control requirements is followed. We also introduce the concept of time-state equations for tracking and optimization purposes. In order to optimize the ...

This paper studies the problem of integrated lot-sizing and maintenance decision making in case multiple products stochastic demand. The is formulated as a Markov process, which goal to find joint production policy that minimizes long run expected total discounted cost. Therefore, classic Q-learning algorithm adopted, decomposition-based approximate Q-value heuristic developed obtain near-optim...

the aim of this paper is to present an efficient method for a rail freight car fleet sizing problem. this problem is modeled mathematically as a multi-period, dynamic and multi-objective, in which the rail freight wagons are assumed to be heterogeneous. demands for different wagons and all travel times are assumed deterministic. in order to increase the utilization of the available wagons in th...

This paper addresses the open shop scheduling problem to minimize the total completion time, provided that one of the machines has to process the jobs in a given sequence. The problem is NP-hard in the strong sense even for the two-machine case. A lower bound is derived based on the optimal solution of a relaxed problem in which the operations on every machine may overlap except for the machine...