In this paper, we propose a new model for designing integrated forward/reverse logistics based on pricing policy in direct and indirect sales channel. The proposed model includes producers, disposal center, distributers and final customers. We assumed that the location of final customers is fixed. First, a deterministic mixed integer linear programming model is developed for integrated logistic...

Two new Mixed Integer Linear Programming (MILP) formulations for modeling a univariate piecewise linear function f were introduced in Li et al. (2008). The first formulation (given by (1)–(3) in Li et al.) uses “Big-M” type constraints, so we denote it by LiBigM. The second formulation (given by (23)–(33) in Li et al.) uses a number of binary variables that is logarithmic in the number of segme...

This study considers outsourcing decisions in a flexible flow shop scheduling problem, in which each job can be processed by either an in-house production line or outsourced. The selected objective function aims to minimize the weighted sum of tardiness costs, in-house production costs, and outsourcing costs with respect to the jobs due date. The purpose of the problem is to select the jobs tha...

We discuss the problem of combining the conflicting objectives of equity and utilitarianism, for social policy making, in a single mathematical programming model. The definition of equity we use is the Rawlsian one of maximising the minimum utility over individuals or classes of individuals. However, when the disparity of utility becomes too great, the objective becomes progressively utilitaria...

State-of-the-art baggage handling systems transport the baggage at high speeds, on a network of tracks, using destination coded vehicles (DCV). In order to ensure the optimal routing of DCVs, in this paper we propose a hierarchical control framework. In this framework switch controllers provide position instructions for each switch in the network. The switch controllers are then supervised by a...

This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizesthe maximum completion time (i.e., makespan or ), maximum earliness ( ), and maximum tardiness ( ) simultaneously. Jobs have non-identical due dates, sequence-dependent setup times and machine-dependentprocessing times. A multi-objective mixed-integer linear programmi...

The selection of best Information System (IS) project from many competing proposals is a critical business activity which is very helpful to all organizations. While previous IS project selection methods are useful but have restricted application because they handle only cases with precise data. Indeed, these methods are based on precise data with less emphasis on imprecise data. This paper pro...

This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...

This paper tackles the real-time Railway Traffic Management Problem (rtRTMP). It is problem of finding optimal choices for train schedules and routes to minimize delays due conflicts. We present a new Constraint Programming (CP) algorithm rtRTMP. The formulation at basis this exploits concept conditional time-interval variables provided in CP Optimizer library. A variable assumes value represen...