Showing 1 - 10 of 173,448
We consider the problem of scheduling multiple, large-scale, make-to-order assemblies under resource, assembly area, and part availability constraints. Such problems typically occur in the assembly of high volume, discrete make-to-order products. Based on a list scheduling procedure which has...
Persistent link: https://www.econbiz.de/10011737305
The problem of scheduling multiple, large scale, make-to-order assemblies is considered. Beside "classical" precedence- and resource constraints as known from resource constrained project scheduling we take spatial resource and part availability constraints into account. The objective is to...
Persistent link: https://www.econbiz.de/10011558728
The problem of scheduling multiple, large scale, make-to-order assemblies is considered. Beside "classical" precedence- and resource constraints as known from resource constrained project scheduling we take spatial resource and part availability constraints into account. The objective is to...
Persistent link: https://www.econbiz.de/10011737214
Persistent link: https://www.econbiz.de/10012625972
Purpose: This study is focused on integrating a strategic perspective for bottleneck selection and exploitation according to the DBR methodology. The researchers developed a systematic process of four steps for the implementation of the first two steps of TOC-DBR in Make-to-Order production...
Persistent link: https://www.econbiz.de/10012178687
Usually, in make-to-order environments which work only in response to the customer’s orders, manufacturers for maximizing the profits should offer the best price and delivery time for an order considering the existing capacity and the customer’s sensitivity to both the factors. In this...
Persistent link: https://www.econbiz.de/10011826051
Complexity proofs often restrict themselves to stating that the problem at hand is a generalization of some other intractable problem, This proof technique relies on the widely accepted assumptions that complexity results hold regardless of the model formulation used to represent the problem and...
Persistent link: https://www.econbiz.de/10011594619
NP-completeness and other complexity proofs often merely State that the problem at hand is a generalization of some other intractable problem. This proof technique relies on the widely accepted assumption that complexity results hold regardless of the model formulation used to represent the...
Persistent link: https://www.econbiz.de/10011594620
In diesem Beitrag zeigen wir, wie die Planungsqualität in einem Unternehmen durch die Integration der Ablaufplanung in die Losgrößenplanung erheblich gesteigert wurde. Gegenstand der Untersuchung war eine Fräsmaschine mit reihenfolgeabhängigen Rüstkosten und Rüstzeiten, wobei für einige...
Persistent link: https://www.econbiz.de/10011743703
Complexity proofs often restrict themselves to stating that the problem at hand is a generalization of some other intractable problem, This proof technique relies on the widely accepted assumptions that complexity results hold regardless of the model formulation used to represent the problem and...
Persistent link: https://www.econbiz.de/10011744026