This paper investigates how to mitigate the impact of adjacent channel interference (ACI) on vehicle-to-vehicle (V2V) broadcast communication by scheduling and power control. The optimal joint scheduling and power control problem, with the objective to maximize the number of connected vehicles, is formulated as a mixed integer programming problem with a linear objective and a quadratic constrai...

Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

This paper considers the Tchebychev distance for a facility location problem with a probabilistic line barrier in the plane. In particular, we develop a mixed-integer nonlinear programming (MINLP) model for this problem that minimizes the total Tchebychev distance between a new facility and the existing facilities. A numerical example is solved to show the validity of the developed model. Becau...

Cloud computing – running large-scale computationand data-intensive services on inexpensive onthe-fly clusters – has become increasingly popular in recent years due to the advent of MapReduce and similar large-scale data parallel systems. Cloud provisioning, i.e., allocating resources for cluster requests, is the first step toward instantiating such clusters. In this report, we formally define ...

hub covering location problem, network design,   single machine scheduling, genetic algorithm,   shuffled frog leaping algorithm   hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...

In this paper, a mixed-integer linear programming model is proposed to integrate batch picking and distribution scheduling problems in order to optimize them simultaneously in an order picking warehouse. A tow-phase heuristic algorithm is presented to solve it in reasonable time. The first phase uses a genetic algorithm to evaluate and select permutations of the given set of customers. The seco...

    Hub covering location problem, Network design,   Single machine scheduling, Genetic algorithm,   Shuffled frog leaping algorithm   Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....

although lot streaming scheduling is an active research field, lot streaming flexible flow lines problems have received far less attention than classical flow shops. this paper deals with scheduling jobs in lot streaming flexible flow line problems. the paper mathematically formulates the problem by a mixed integer linear programming model. this model solves small instances to optimality. moreo...