in this paper, we present a genetic algorithm (ga) for optimization of a multi-mode resource constrained time cost trade off (mrctct) problem. the proposed ga, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. beyond earlier studies on time-cost trade-off problem, in mrctct problem, resource requirements of each execution mo...

A p-hub center network design problem consists of some nodes as hubs and allocation of non-hub nodes to them wherein the maximum travel times between any pair of nodes is minimized. The distinctive feature of this study is proposing a new mathematical formulation for modeling costs in a p-hub center problem. Here, instead of considering costs as a linear function of distance, for the first time...

This paper proposes a mathematical model of network formation with general method of share of the link costs. In some published papers of the network formation, it is assumed that all players pay the same amount of cost for forming or maintaining a link, or a player who offers to form a new link pays all of the link cost. In this paper, a mathematical model of network formation with general all...

We discuss the cost allocation problem faced by a network operator, where the fixed (residual) cost of the network has to be allocated among its users. Usage-based methods, such as the postage stamp rate method and the MW-mile method, are easy to understand and compute, but may yield cost allocations for which some transactions are subsidizing others. Formally, this is equivalent to allocations...

In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several classes. The unit time processing cost for a processor varies with the class to which the processor belongs. There are N jobs, each of which must be processed from a given start time to a given finish time without preemp...

In this paper, we investigate resource allocation games with machine activation cost when the resources are limited. We take job scheduling for example. Here, we typically have a fixed number m of identical machines. No machines are initially activated and each machine activated incurs a fixed machine activation cost. Jobs are self-interested players who choose machines with the objective of mi...