## Search

Now showing items 1-10 of 11

#### Binary integer formulation for mixed-model assembly line balancing problem

(Pergamon Press, 1998-04-01)

The assembly line balancing problem has been a focus of interest to the academicians of production/operations
management for the last 40 years. Although there are numerous studies published
on the various aspects of the ...

#### A goal programming approach to mixed-model assembly line balancing problem

(Elsevier, 1997)

In this paper, a binary goal programming model for the mixed-model assembly line balancing (ALB) problem is developed. The model is based on the concepts developed by Patterson and Albracht [1] and the model of Deckro and ...

#### The network design problem with relays

(Elsevier, 2007)

The network design problem with relays (NDPR) is defined on an undirected graph G = (V, E, K), where V = {1, ..., n} is a vertex set, E = {(i, j) : i, j ∈ V, i < j} is an edge set. The set K = {(o(k), d(k))} is a set ...

#### Solving the hazmat transport network design problem

(Pergamon Press, 2008)

In this paper, we consider the problem of network design for hazardous material transportation where the government designates a network, and the carriers choose the routes on the network. We model the problem as a bilevel ...

#### Towards finding global representations of the efficient set in multiple objective mathematical programming

(John Wiley & Sons, 1997)

We propose and justify the proposition that finding truly global representations of the efficient sets of multiple objective mathematical programs is a worthy goal. We summarize the essential elements of a general global ...

#### Customer order scheduling problem: a comparative metaheuristics study

(Springer, 2007)

The customer order scheduling problem (COSP) is defined as to determine the sequence of tasks to satisfy the demand of customers who order several types of products produced on a single machine. A setup is required whenever ...

#### Exact algorithms for the joint object placement and request routing problem in content distribution networks

(2008)

This paper describes two exact algorithms for the joint problem of object placement and request routing in a content distribution network (CDN). A CDN is a technology used to efficiently distribute electronic content ...

#### Scheduling to minimize the coefficient of variation

(Elsevier, 1996)

In this paper, we address the problem of uninterruptedly scheduling a set of independent jobs that are ready at time zero with the objective of minimizing the coefficient of variation (CV) of their completion times. We ...

#### New heuristic for the dynamic layout problem

(Palgrave Macmillan, 2003)

The dynamic layout problem addresses the situation where the traffic among the various units within a facility changes over time. Its objective is to determine a layout for each period in a planning horizon such that the ...

#### A multicriteria facility location model for municipal solid waste management in North Greece

(Elsevier, 2008)

Up to 2002, Hellenic Solid Waste Management (SWM) policy specified that each of the country's 54 prefectural governments plan its own SWM system. After 2002, this authority was shifted to the country's 13 regions entirely. ...