---

In some industries as foundries, it is not technically feasible to interrupt a processor between jobs. This restriction gives rise to a scheduling problem called no-idle scheduling. This paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. The problem is first mathematically formulated by three different mixed integer linear programming models. Since open shop scheduling problems are NP-hard, only small instances can be solved to optimality using these models. Thus, to solve large instances, two meta-heuristics based on simulated annealing and genetic algorithms are developed. A complete numerical experiment is conducted and the developed models and algorithms are compared. The results show that genetic algorithm outperforms simulated annealing.

---

Recently, much attention has been given to Stochastic demand due to uncertainty in the real -world. In the literature, decision-making models and suppliers\' selection do not often consider inventory management as part of shopping problems. On the other hand, the environmental sustainability of a supply chain depends on the shopping strategy of the supply chain members. The supplier selection plays an important role in the green chain. In this paper, a multi-objective nonlinear integer programming model for selecting a set of supplier considering Stochastic demand is proposed. while the cost of purchasing include the total cost, holding and stock out costs, rejected units, units have been delivered sooner, and total green house gas emissions are minimized, while the obtained total score from the supplier assessment process is maximized. It is assumed, the purchaser provides the different products from the number predetermined supplier to a with Stochastic demand and the uniform probability distribution function. The product price depends on the order quantity for each product line is intended. Multi-objective models using known methods, such as Lp-metric has become an objective function and then uses genetic algorithms and simulated annealing meta-heuristic is solved.

---

Delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. In this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several products to be delivered to customers with respect to their demands and with consideration of different soft time windows for each customer, heterogeneous distribution fleet and customer selection option for the distributer. The proposed model is solved with TH method. The two genetic algorithm and simulated annealing algorithm are used to solve large-sized problems. Finally, their results are compared to each other when the optimization software becomes unable of solution representation.

---

This paper presents the capacitated Windy Rural Postman Problem with several vehicles. For this problem, two objectives are considered. One of them is the minimization of the total cost of all vehicle routes expressed by the sum of the total traversing cost and another one is reduction of the maximum cost of vehicle route in order to find a set of equitable tours for the vehicles. Mathematical formulation is provided. The multi-objective simulated annealing (MOSA) algorithm has been modified for solving this bi-objective NP-hard problem. To increase algorithm performance, Taguchi technique is applied to design experiments for tuning parameters of the algorithm. Numerical experiments are proposed to show efficiency of the model. Finally, the results of the MOSA have been compared with MOCS (multi-objective Cuckoo Search algorithm) to validate the performance of the proposed algorithm. The experimental results indicate that the proposed algorithm provides good solutions and performs significantly better than the MOCS.