Showing 1 - 10 of 44
This paper presents a new algorithm for the dynamic Multi-Level Ca-pacitated Lot Sizing Problem with Setup Carry …
Persistent link: https://www.econbiz.de/10005867419
-and-optimize algorithm. Each of these programs is optimized over allreal-valued variables, but only a small subset of binary setup variables …
Persistent link: https://www.econbiz.de/10005867423
This paper presents a linear programming approach to analyze and optimizeow lines with limited buer capacities and stochastic processing times. The basic ideais to solve a huge but simple linear program that models an entire simulation run of amulti-stage production process in discrete time, to...
Persistent link: https://www.econbiz.de/10005867427
In this paper, we present a bounding methodology that allows to compute a tight lower boundon the cycle time of fork--join queueing networks with blocking and with general service timedistributions. The methodology relies on two ideas. First, probability masses fitting (PMF)discretizes the...
Persistent link: https://www.econbiz.de/10005868677
Proposals are often made to tax goods which are environmentally damaging. Manysuch goods are consumed both directly by households and industry at large: for example,carbon-intensive fuel, waste water or congested road space. This paper adopts a tax-reformsetting to evaluate such a policy. The...
Persistent link: https://www.econbiz.de/10005870243
Die Autoren stellen einen Ansatz vor, mit dem das Erfahrungswissenüber die Produktionsregelung mit künstlichen neuronalen Netzenso aufgearbeitet und strukturiert werden kann...
Persistent link: https://www.econbiz.de/10005848241
In this paper we propose a hybrid ACO approach to solve a full truckload transportation problem. Hybridization is achieved through the use of a problem specific heuristic.(...)
Persistent link: https://www.econbiz.de/10005841609
finding the number of clusters existing in them. The voting part of the algorithm allows us to combine several runs of …
Persistent link: https://www.econbiz.de/10005841714
Given a finite set of spheres of different sizes we study the three-dimensional StripPacking Problem (3D-SPP) as well as the three-dimensional Knapsack Problem (3D-KP).The 3D-SPP asks for a placement of all spheres within a cuboidal strip of fixed width andheight so that the variable length of...
Persistent link: https://www.econbiz.de/10005870648
efficient hybrid algorithm including a tabu searchalgorithm for routing and a tree search algorithm for loading is introduced …
Persistent link: https://www.econbiz.de/10009138325