Showing 1 - 10 of 59
Given a spatial system of clients' demand functions, this paper proposes solution methods to determine the price(s), the number, the locations, the sizes, and the market areas of the plants supplying the clients in order to maximize the profit of the firm. Three alternative spatial price...
Persistent link: https://www.econbiz.de/10009191794
We present a survey of over 50 representative problems in location research. Our goal is not to review all variants of different location models or to describe solution results, but rather to provide a broad overview of major location problems that have been studied, indicating briefly how they...
Persistent link: https://www.econbiz.de/10009191883
We consider a finite-horizon, multiechelon inventory system in which the surplus of stock can be sold (i.e., disposed) in the secondary markets at each stage in the system. What are called <i>nested echelon order-up-to policies</i> are shown to be optimal for jointly managing inventory replenishments...
Persistent link: https://www.econbiz.de/10010990555
Given the widespread use of the hub and spoke network architecture and its growing importance to competitiveness in logistics, communication, and mass transportation, there has been considerable interest by practitioners and researchers alike in finding efficient methods for designing such...
Persistent link: https://www.econbiz.de/10009189690
We address the problem of sequencing jobs, each of which is characterized by one of a large number of possible combinations of customer-specified options, on a paced assembly line. These problems arise frequently in the automotive industry. One job must be launched into the system at equal time...
Persistent link: https://www.econbiz.de/10009191205
We consider multimachine scheduling problems with earliness and tardiness costs. We first, analyze problems in which the cost of a job is given by a general nondecreasing, convex function F of the absolute deviation of its completion time from a (common) unrestrictive due-date, and the objective...
Persistent link: https://www.econbiz.de/10009191554
decision variables to facilitate solution. We then develop two heuristics to obtain approximate solutions to the TDP. The first … heuristic is an LP-based method, while the second uses a combination of LP relaxation and branch and bound. The two heuristics …
Persistent link: https://www.econbiz.de/10009191634
published heuristics. We also show how the methodology can be applied, taking existing products of both the firm and the …
Persistent link: https://www.econbiz.de/10009191659
near-myopic bounds, heuristics, testing. Management Sci. 41(2) 334--343.), which assumed zero lag, to obtain near …-myopic bounds and heuristics for the nonstationary stochastic leadtime problem with arbitrary sequences of demand distributions, and … to obtain planning horizon results. Four heuristics have been tested on a number of different demand scenarios over a …
Persistent link: https://www.econbiz.de/10009191678
a set of activities that are managed by several heuristics. We found that some heuristics were effective in reducing the …
Persistent link: https://www.econbiz.de/10009191712