-
作者：POTTS, CN; VANWASSENHOVE, LN
作者单位：INSEAD Business School
摘要：In the problem of scheduling a single machine to minimize total late work, there are n jobs to be processed for which each has an integer processing time and a due date. The objective is to minimize the total late work, where the late work for a job is the amount of processing of this job that is performed after its due date. For the preemptive total late work problem, an O(n log n) algorithm is derived. The nonpreemptive total late work problem is shown to be NP-hard, although efficient algor...
-
作者：CHAND, S; CHHAJED, D
作者单位：University of Illinois System; University of Illinois Urbana-Champaign
摘要：The problem of simultaneous determination of optimal due dates and optimal sequence for N-job single machine problem with multiple due dates is considered in this paper. The penalty for a job is assumed to be a linear function of the due date and the earliness/tardiness for the job. The objective is to minimize the total penalty for all jobs. An efficient optimal algorithm to solve the problem is developed and several results are provided.
-
作者：BOUAKIZ, M; SOBEL, MJ
作者单位：State University of New York (SUNY) System; Stony Brook University; State University of New York (SUNY) System; Stony Brook University; State University of New York (SUNY) System; Stony Brook University
摘要：A base-stock policy is shown to be optimal when a dynamic version of the news vendor model is optimized with respect to an exponential utility criterion.
-
作者：WINKLER, RL; CLEMEN, RT
作者单位：Duke University; University of Oregon
摘要：In the combination of forecasts, weighted averages that attempt to take into account the accuracy of the forecasts and any dependence among forecasts tend to perform poorly in practice. An important factor influencing this performance is the sensitivity, or instability, of the estimated weights used to generate the combined forecast. The intent of this paper is to look at this instability via graphs and the sampling distribution of the weights. Results are developed for the combination of two ...
-
作者：GALLEGO, G; MOON, I
摘要：This paper considers the Economic Lot Scheduling Problem with Reducible Setup Times (ELSP-RS), that is, determining a multiple product, single facility cyclic schedule to minimize holding and setup costs when setup times can be reduced, at the expense of setup costs, by externalizing setup operations. We develop an efficient algorithm that finds an optimal or near-optimal production schedule. Computational results indicate that dramatic savings are possible for highly utilized facilities.
-
作者：SINGHAL, K
摘要：Discrete optimal control theory is used to develop an efficient noniterative algorithm for solving the multiproduct production and work force planning problems with a quadratic cost function. The quadratic cost models allow uncertainties to be handled directly because they minimize the expected cost if unbiased expected demand forecasts are given. A real-world problem may involve as many as 200,000 variables. The noniterative algorithm makes the computations, irrespective of the number of prod...
