this study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. the problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. the time interval between consecutive maintenance activities as well as the...

Multicommodity distribution problem is one of the most interesting and useful models in mathematical programming due to its major role in distribution networks. The purpose of this paper is to describe and solve a special class of multicommodity distribution problems in which shipment of a commodity from a plant to a customer would go through different distribution centers. The problem is t...

The tourist trip design problem (TTDP) is a well-known extension of the orienteering problem, where objective to obtain an itinerary points interest for that maximizes his/her level interest. In several situations, point depends on when visited, and may delay arrival in order get higher this paper, we present discuss two variants TTDP with time-dependent recommendation factors (TTDP-TDRF), whic...

This paper aims to compare a two-echelon and a single-echelon distribution system. A mathematical model for the Single-Echelon Capacitated Vehicle Routing Problem (SE-CVRP) is proposed. This SE-CVRP is the counterpart of Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) introduced in the authors’ previous work. The proposed mathematical model is Mixed-Integer Non-Linear Programming (MIN...

Robust supplier selection problem, in a scenario-based approach has been proposed, when the demand and exchange rates are subject to uncertainties. First, a deterministic multi-objective mixed integer linear programming is developed; then, the robust counterpart of the proposed mixed integer linear programming is presented using the recent extension in robust optimization theory. We discuss dec...

The Orienteering Problem with Time Windows (OPTW) is a variant of the Orienteering Problem (OP). Given a set of nodes including their scores, service times and time windows, the goal is to maximize the total of scores collected by a particular route considering a predefined time window during which the service has to start. We propose an Iterated Local Search (ILS) algorithm to solve the OPTW, ...

In the present paper a bi-objective integer linear programming problem (BILP) is discussed. The main effort in this work to effectively implement ?-constraint method produce complete set of non dominated points. convergence algorithm has been established theoretically. Further comparative study some existing also made.

in this paper, we consider a flow shop scheduling problem with availability constraints (fsspac) for the objective of minimizing the makespan. in such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. we proposed a mixed-integer linear programming (milp) model for this problem which can generate non-permutation schedules. furthermor...

This study addresses a stochastic structure for generation companies (GenCoʼs) that participate in hydro-thermal self-scheduling with a wind power plant on short-term scheduling for simultaneous reserve energy and energy market. In stochastic scheduling of HTSS with a wind power plant, in addition to various types of uncertainties such as energy price, spinning /non-spinning reserve prices, unc...