-
作者：KOULAMAS, C
摘要：We provide a unified framework for the total tardiness problem by surveying the related literature in the single-machine, parallel machine, flowshop and jobshop settings. We focus on critically evaluating the heuristic algorithms; we also propose new heuristics for both the single-machine and the parallel-machine tardiness problems. Finally, we identify the areas where further research is needed and we give directions for future research.
-
作者：GENDRON, B; CRAINIC, TG
作者单位：Universite de Montreal
摘要：We present a detailed and up-to-date survey of the literature on parallel branch-and-bound algorithms. We synthesize previous work in this area and propose a new classification of parallel branch-and-bound algorithms. This classification is used to analyze the methods proposed in the literature. To facilitate our analysis, we give a new characterization of branch-and-bound algorithms, which consists of isolating the performed operations without specifying any particular order for their executi...
-
作者：FEDERGRUEN, A; TZUR, M
作者单位：Tel Aviv University; University of Pennsylvania
摘要：We address the Joint Replenishment Problem (JRP) where, in the presence of joint setup costs, dynamic lot sizing schedules need to be determined for m items over a planning horizon of N periods, with general time-varying cost and demand parameters. We develop a new, so-called, partitioning heuristic for this problem, which partitions the complete horizon of N periods into several relatively small intervals, specifies an associated joint replenishment problem for each of these, and solves them ...
-
作者：BENKHEROUF, L; GLAZEBROOK, KD; OWEN, RW
作者单位：Newcastle University - UK
摘要：Conventional analyses of stochastic resource allocation problems based on Gittins' indices frequently yield policies which involve an unacceptable amount of switching of the resource from one option to another. This paper discusses a variety of methodologies aimed at solving this problem. They principally involve the development and analysis of stochastic resource allocation models incorporating switching costs together with a consideration of a new class of single-visit policies for which eac...
-
作者：LEE, CC
摘要：Two standard results of previous bargaining models state that delay is generally not expected to occur under complete information, and bargaining outcome depends crucially on the bargainers' intrinsic characteristics that determine their reservation prices, and, in general, bargainers with ''better'' reservation prices tend to get better outcomes. This paper considers a bilateral bargaining problem with complete information in which one of the bargainers, the buyer, is allowed to search while ...
-
作者：TROUTT, MD
摘要：In the Method of Abstract Forces for the direction finding (or tradeoff cut) subproblems of interactive multicriterion optimization, it is necessary to scale criterion gradients. Previously, an ad hoc, analyst assisted, but nevertheless effective scaling method was used. This paper introduces a concept of abstract mass. It is shown that the previous ad hoc scaling method may be considered an approximation to the present direction-specific approach. Also, the abstract mass approach provides a s...
-
作者：FRIESZ, TL; BERNSTEIN, D; MEHTA, NJ; TOBIN, RL; GANJALIZADEH, S
作者单位：Princeton University
摘要：In this paper we present tatonnement models for calculating static Wardropian user equilibria on congested networks with fully general demand and cost structures. We present both a qualitative analysis of stability and numerical studies which show that such an approach provides a reliable means for determining static user equilibria. We also describe circumstances for which these models depict day-to-day adjustments from one realizable disequilibrium state to another and how these adjustment p...
-
作者：FISHMAN, GS
摘要：Several recent papers have suggested using a product estimator in Monte Carlo Markov chain sampling for estimating the volume of a convex body, the permanent of a matrix and the distribution of first-passage time for a positive recurrent Markov chain. The present paper analyzes the properties of this estimator when each replication starts in an arbitrarily selected state. In particular, it describes a procedure for determining optimal warm-up intervals and optimal sample sizes to achieve a spe...
-
作者：PATEROK, M; ETTL, M
作者单位：University of Erlangen Nuremberg
摘要：Scheduling strategies for real-time systems often employ semipreemptive priorities, allowing for a deadline enforcement by preemptive priorities while avoiding the overhead of unnecessary interrupts. A variety of these strategies can be described by preemption-distance priorities in a straightforward and flexible fashion. A preemption-distance is a globally assigned positive integer number. An arriving task must exceed the priority of the task being served by at least the preemption-distance t...
-
作者：DUENYAS, I
摘要：In a recent paper, L. M. Wein (1992) addressed the problem of scheduling a network of queues. Given a multistation, multiclass queueing network, the problem involves deciding when to release a job to the network as well as how to sequence jobs at each machine in the network to meet a desired throughput level. By approximating this problem by a control problem involving Brownian motion, Wein derived effective heuristics, which easily outperformed traditional work release and sequencing rules. H...
