Showing 1 - 10 of 125
better solutions than some heuristics designed especially for those problems. Test results on the bottleneck problem indicate …
Persistent link: https://www.econbiz.de/10009203846
efficiency of a known branch-and-bound algorithm. Moreover, we present some heuristics and compare them with two different …
Persistent link: https://www.econbiz.de/10009204346
Motivated by a problem faced by a large manufacturer of a consumer product, we explore the interaction between production planning and capacity acquisition decisions in environments with demand growth. We study a firm producing multiple items in a multiperiod environment where demand for items...
Persistent link: https://www.econbiz.de/10009208838
We derive a sharp upper bound on the minimal forecast horizon in the discounted dynamic lot size model with constant initial demand. This bound is given by m(m 1), where m is the EOQ's worth, i.e., the number of periods for which the total demand equals Economic Order Quantity. Our results do...
Persistent link: https://www.econbiz.de/10012706709
We report the solution to optimality of ten large-scale symmetric travelling salesman problems. The travelling salesman problem (TSP) is one of the standard problems of the Operations Research/Management Science literature and is cited in virtually every textbook on this subject. The TSP is a...
Persistent link: https://www.econbiz.de/10009208889
This paper considers as single machine scheduling problem in which jobs have due dates and deadlines. A job may be completed after its due date, but not after its deadline, in which case it is tardy. A branch and bound algorithm is proposed to find a schedule which minimizes the weighted number...
Persistent link: https://www.econbiz.de/10009208743
and bound technique. Capacity constraints for processors are then introduced. Three intuitively appealing heuristics are …
Persistent link: https://www.econbiz.de/10009208788
A recurring problem in project management involves the allocation of scarce resources to the individual jobs comprising the project. In many situations such as audit scheduling, the resources correspond to individuals (skilled labour). This naturally leads to an assignment type project...
Persistent link: https://www.econbiz.de/10009208850
The computation of economic equilibria, given specific supply and demand functions, is a well-established problem normally treated by fixed point methods or other iterative schemes which converge to a point satisfying the equilibrium criteria. In cases where there are several points which...
Persistent link: https://www.econbiz.de/10009209068
For a given planning horizon, workforce composition and set of labor requirements, personnel scheduling often reduces to solving three problems. The first is concerned with the assignment of days off; the second involves assigning workers to shifts during the day; and the third involves the...
Persistent link: https://www.econbiz.de/10009209120