Showing papers in "European Journal of Operational Research in 1989"

TL;DR: The literature is classified based on the ways researchers have defined flexibility and the approaches used in measuring it, which indicates the importance of flexibility in manufacturing decision making.

TL;DR: A critical review of a particular segment of scheduling research in which the due to date assignment decision is of primary interest is presented, observing that while the static single- machine problem with constant or common due dates has been well researched, very little or no work has been done on the dynamic multi-machine problem with sophisticated due date assignment methods.

TL;DR: In this article, the literature dealing with integrated inventory models (buyer-vendor coordination) has been reviewed and a scheme to classify these models is presented, and future research areas have been identified.

TL;DR: A survey of the maximization location models in the Operations Research literature is contained, and a synthesis of the solution procedures with emphasis on similarities and differences is presented.

TL;DR: This paper proposed a set of procedures that focus on major pattern components of a given composite behavior pattern and investigated the appropriateness and properties of those procedures through a series of simulation experiments.

TL;DR: The Dynamics of Change and Stability: Changing an Archetype: Reorientations 9. Unresolved Excursions 10. Retaining an archetype: Discontinued Excursions as discussed by the authors.

TL;DR: In this paper, a new heuristic method is presented for solving the m -machine, n -job flow shop scheduling problem, which is composed of two phases: the first finds an initial sequence using an analogy with the travelling salesman problem and the second tries to improve this solution using taboo search techniques.

TL;DR: Three formulations of possibilistic linear regression analysis are proposed here to deal with fuzzy data to be able to obtain easily fuzzy parameters in possibillistic linear models and to add other constraint conditions which might be obtained from expert knowledge of fuzzy parameters.

TL;DR: This work evaluates the effect of ignoring routeing when locating depots by using a two stage process (location and routeing), and it is shown that the best solution after the location stage does not necessarily generate the lowest cost Solution after the routeing stage.

TL;DR: An extensive computational analysis of several initial solution algorithms is presented, which identifies the tradeoffs between solution quality and computational requirements and concludes that the greedy procedure reduces the required number of trucks and increases the truck utilization.

TL;DR: This survey considers emerging approaches of heuristic search for solutions to combinatorially complex problems that arise in business applications, such as in manufacturing operations, financial investment, capital budgeting and resource management.

TL;DR: The question of approximate articulation of preference values encountered when the decision maker prefers to state his strength of preference as a range of scale value rather than a single ‘precise’ value is explored.

TL;DR: In this article, the authors describe a family of stochastic location-routing problems which consist of simultaneously locating a depot among a set of potential sites, determining the vehicle fleet size and designing collection routes through customers having random supplies.

TL;DR: These works shed new light on various interpretations of fuzzy sets and clarify their links with probability theory; conversely Zadeh's logical point of view on fuzzy sets suggests a set-theoretic perspective on uncertainty measures, that brings together numerical quantification and logic.

TL;DR: In this article, the focus of the research in the production planning area has been aimed at the needs of make-to-stock (MTS) companies, however, the requirements of the two sectors are quite different and there is a need for more research to provide production planning systems which have been designed specifically for the MTO sector.

TL;DR: The methods available for determining the economic operating policy for jointly replenished items under deterministic and stochastic demand conditions are reviewed and experimental findings are discussed.

TL;DR: The performance of scheduling algorithms for a certain kind of manufacturing environment, called the “Flexible Flowshop”, which consists of a certain number of machine centers, is discussed and heuristic algorithms are presented and studied in the worst and average case performance contexts.

TL;DR: This paper first derive instantaneous and cumulative measures of Markov and Markov reward model behavior, and compares the complexity of several competing algorithms for the computation of these measures.

TL;DR: The advances that have been made in optimal product design and market segmentation models are discussed, along with brief descriptions of related topics, such as product bundle design and pricing.

TL;DR: It is shown how to modify a primal-dual version of Erlenkotter's exact algorithm to get an improved procedure and Computational experience with large-scale problems indicates that an implementation of the modified algorithm is faster by more than one order of magnitude.

TL;DR: In this paper, several implementations of a general label correcting algorithm are discussed for bicriterion networks and their implementations are compared on networks of varying size and having varying degrees of correlation between the two criteria.

TL;DR: In this article, the optimal insertion sequence for a fixed feeder setting is obtained by considering the problem as a three-dimensional asymmetric traveling salesman problem, and the overall problem is solved heuristically and this approach brings suboptimal but in practice good enough component insertion sequences and feeder permutations.

TL;DR: A structural approach has been adopted which includes customer orders planning and job release functions and the basic concepts developed include a hierarchy of backlogs of work responsible for a consequent hierarchy of lead times that add up to the total delivery lead time.

TL;DR: This is a review of a selected set of location papers and a research agenda and several new models are structured using the new formulation tools that are described.

TL;DR: This review formalizes the general model of competitive spatial models and delineates its components, and surveys some of the major results and put them into perspective.

TL;DR: The problem of maximizing the share of a new product introduced in a competitive market is shown to be NP-hard, and a directed graph representation of the problem is used to construct shortest-path and dynamic-programming heuristics.

TL;DR: It is concluded that some areas and problems are more receptive than others and the emphasis is on developing flexible, integrative, and robust scheduling systems that provide the correct balance between (centralised) planning and shopfloor production control.

TL;DR: In this article, a choice function based on t-norms of valued binary relations is introduced, and strict preference is also specified with the use of a tnorm, and rationality conditions are studied.

TL;DR: An extensive search of journal publications on heuristic methods and applications produced 442 articles published in 37 journals during the last sixteen years, with some interesting historical patterns and directions for future work revealed.

TL;DR: In this article, an economic production quantity model with a flexible and imperfect production process is proposed, where the inventory optimization problem is formulated as a geometric program (GP) and solved to obtain closed-form optimal solutions.