Usually, in make-to-order environments which work only in response to the customer’s orders, manufacturers for maximizing the profits should offer the best price and delivery time for an order considering the existing capacity and the customer’s sensitivity to both the factors. In this paper, an integrated approach for pricing, delivery time setting and scheduling of new arrival orders are prop...

in our country, school bus routes are determined by experiments of driver without considering the scientific optimum route and location. traversing additional routes will always result an increase in vehicle movements and fuel consumption and enormous costs. hence, this paper will study the school bus routing in tehran considering special students and a model will be presented to minimize trave...

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

this paper proposes a new mathematical model for designing and planning postal parcels carriage and postal networks. the objective of postal network designing is to determine the location, size and connection between the postal stations in a city, province or country. in this paper, a kind of multiple locations-allocations hub problem with limited capacity in collecting, distributing and broadc...

Let Y be a convex set inRk defined by polynomial inequalities and equations of degree at most d ≥ 2 with integer coefficients of binary length at most l. We show that if the set of optimal solutions of the integer programming problem min{yk | y = (y1, . . . , yk) ∈ Y ∩Zk} is not empty, then the problem has an optimal solution y∗ ∈ Y ∩Zk of binary length ld O(k ). For fixed k, our bound implies ...