Showing 1 - 10 of 168
Persistent link: https://www.econbiz.de/10011558754
This paper focuses on various issues that need to be considered when an analyst wishes to predict the demand for a new technological product. The interplay of the strategic behavior of the firm, notably with regard to preannouncing the future availability of the new product and the behavior of...
Persistent link: https://www.econbiz.de/10011653563
Persistent link: https://www.econbiz.de/10011885359
Besonderheiten vorgestellt. Es folgt die Kennzeichnung museumsrelevanter Aspekte der Innovation. Danach wird untersucht, wo die …
Persistent link: https://www.econbiz.de/10011653572
Persistent link: https://www.econbiz.de/10011658279
The elastic generalized assignment problem (eGAP) is a natural extension of the generalized assignment problem (GAP) where the capacities are not fixed but can be adjusted which is expressed by continuous variables. These variables might be un-bounded or restricted by a lower or upper bound,...
Persistent link: https://www.econbiz.de/10011558704
The elastic generalized assignment problem (eGAP) is a natural extension of the generalized assignment problem (GAP) where the capacities are not any longer fixed but can be adjusted which is expressed by continuous variables. These variables might be unbounded or restricted by a lower or upper...
Persistent link: https://www.econbiz.de/10011558706
A single round robin tournament (SRRT) consists of n teams and a set of periods. Matches between the teams have to be scheduled such that each team plays against each other team exactly once and each team plays at most once per period. In order to establish fairness among teams we consider a...
Persistent link: https://www.econbiz.de/10011558707
We introduce a new class of valid inequalities for the maximum round robin tournament (MRRT) problem. They strengthen the linear relaxation and improve the upper bound. We also answer negatively the question of Briskorn if the optimal objective value of the MRRT problem and that of its...
Persistent link: https://www.econbiz.de/10011558708
This paper studies the allocation of buffer times in a single machine environment. Buffer times are a common tool to protect the schedule against disruptions such as machine failures. We introduce new classes of robust machine scheduling problems. For an arbitrary scheduling problem 1
Persistent link: https://www.econbiz.de/10011558710