Management Science

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
Management Science - Tập 19 Số 11 - Trang 1283-1288 - 1973
Stephen J. Balut
The n job, one-machine scheduling problem is considered where set-up and processing times are random and the objective is to minimize the number of late jobs. In the deterministic case, Moore's algorithm is known to produce an optimal schedule. A chance-constrained formulation of the nondeterministic problem is derived in which a job is processed if the probability that it will be complet...... hiện toàn bộ
A Renewal Decision Problem
Management Science - Tập 24 Số 5 - Trang 554-561 - 1978
Cyrus Derman, Gerald J. Lieberman, Sheldon M. Ross
A system (e.g., a motor vehicle) must operate for t units of time. A certain component (e.g., a battery) is essential for its operation and must be replaced each time it fails. There are n types of replacement components. A type i replacement costs Ci and has a random life with distribution depending on i. There is no salvage value associated with the particular compo...... hiện toàn bộ
Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
Management Science - Tập 29 Số 3 - Trang 384-388 - 1983
Hiroshi Kise, Toshihide Ibaraki
In 1973, Balut gave an algorithm to solve an n-job one machine scheduling problem in which processing times are random variables and the objective is to minimize the number of tardy jobs with a specified certainty level. This note, however, presents an example for which his algorithm fails to give an optimal schedule. Furthermore, there does not seem to exist any such efficient algorithm ...... hiện toàn bộ
The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
Management Science - Tập 24 Số 5 - Trang 530-534 - 1978
W. Townsend
N jobs are to be sequenced on a single machine, each job carrying a penalty cost which is a quadratic function of its completion time. The objective is to find a sequence which minimizes the total penalty. Criteria are developed for ordering a pair of adjacent jobs in a sequence and these are incorporated into a branch-and-bound procedure.
Does Firm Investment Respond to Peers’ Investment?
Management Science - Tập 67 Số 8 - Trang 4703-4724 - 2021
Maria Cecilia Bustamante, Laurent Frésard
We study whether, how, and why the investment of a firm depends on the investment of other firms in the same product market. Using an instrumental variable based on the presence of local knowledge externalities, we find a sizeable complementarity of investment among product market peers, holding across a large majority of sectors. Peer effects are stronger in concentrated markets, featuri...... hiện toàn bộ
Peer Effects of Corporate Social Responsibility
Management Science - Tập 65 Số 12 - Trang 5487-5503 - 2019
Jie Cao, Hao Liang, Xintong Zhan
We investigate how firms react to their product-market peers’ commitment to and adoption of corporate social responsibility (CSR) using a regression discontinuity design approach. Relying on the passage or failure of CSR proposals by a narrow margin of votes during shareholder meetings, we find the passage of a close-call CSR proposal and its implementation are followed by the adoption of...... hiện toàn bộ
Combining Probability Distributions from Dependent Information Sources
Management Science - Tập 27 Số 4 - Trang 479-488 - 1981
Robert L. Winkler
Inferences or decisions in the face of uncertainty should be based on all available information. Thus, when probability distributions for an uncertain quantity are obtained from experts, models, or other information sources, these distributions should be combined to form a single consensus distribution upon which inferences and decisions can be based. An important feature of information f...... hiện toàn bộ
Decomposition, Pricing for Decentralization and External Economies
Management Science - Tập 11 Số 1 - Trang 1-32 - 1964
William J. Baumöl, Tibor Fabian
The decomposition procedure for the solution of large scale linear programs is described in an elementary manner with illustrative calculations. Its economic interpretation as a procedure for decentralized decision by the multi-division firm or the multi-sector economy is explained in detail. Decomposition is shown to provide internal prices for decentralized decision making in the presen...... hiện toàn bộ
Composition vs. Decomposition: Two Approaches to Modeling Organizational Decision Processes
Management Science - Tập 24 Số 14 - Trang 1491-1499 - 1978
Dennis J. Sweeney, E. P. Winkofsky, Probir Roy, Norman R. Baker
The most popular approach to developing mathematical models of organizational decision processes, the decomposition approach, begins with a mathematical statement of an ideal organizational problem and follows a process of decomposition to derive sub-problems solved by separate units at (possibly) different levels of the organization. Conversely, the composition approach starts with mathe...... hiện toàn bộ
Economic Ordering Frequency for two Items Jointly Replenished
Management Science - Tập 17 Số 6 - Trang B-406-B-410 - 1971
Frank T. Shu
The decision model to be presented is typically applicable to the batch processing industry where a batch of product is blended and subsequently packaged into various types of containers. When a product is packaged into more than one type container immediately after its manufacture, these items are said to be jointly replenished. In the case of joint replenishment, the e...... hiện toàn bộ
Tổng số: 325   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10