Search results for "Operations Research"
showing 10 items of 1297 documents
BUILDING THE POM CURRICULUM FOR A PRIVATIZING ECONOMY: AN EVALUATION FROM MANUFACTURERS‘ PERSPECTIVES
2009
Manufacturing in Eastern European countries is in transition to open-market competition. One transitional issue is university education for operations managers from the perspective of business practitioners. Survey responses by 203 manufacturing professionals from 83 companies provide recommendations for operations management education at the University of Sibiu in Romania. The recommendations substantially reorient curricula that traditionally prepared students for professions in centrally controlled economies rather than for open-market competition. The redesigned curriculum has an educational advantage in its integration of production, marketing, and engineering, all under one college of…
Statistical performance of a multiclass bulk production queueing system
2004
Abstract In this paper, we discuss how to statistically analyze a make-to-stock production system the behaviour of which depends on a multiclass bulk queueing system. The performance of the system is evaluated in terms of the different demands of products, processing times and, mainly, through the finished product inventory and other related measures that quantify the queueing effects in the system. A numerical example which illustrates the applicability of the results in an inventory scenario is also discussed.
Une stratégie de test de la racine unitaire
1991
This paper compares three approaches of the unit root testing strategy issue : i.e. the DICKEY, BELL and MILLER (1986) approach, elaborated for prevision purposes, which advocates the estimation of a model without trend at the outset, in opposition to the PERRON (1988) and HENIN and JOBERT (1990) testing strategies. The latter is undoubtedly operational in empirical works but it doesn’t encompass joint tests explicitly. We then suggest an unifiedgeneral framework embracing the last two appoaches and giving a practical scheme which is as complete and operational as possible. The behaviour of these strategies is assesed in an empirical study of the seasonaly adjusted real GDP in France and an…
Evaluation of routing policies using an interval-valued TOPSIS approach for the allocation rules
2021
Abstract The success of warehouse management in a supply chain widely depends on an efficient and effective retrieve of customer orders, which is known as the picking process. This paper investigates various routing policies of pickers under two different allocation methods of items in a warehouse of fixed layout, and evaluates their performance in terms of the resulting travel distance by means of a simulation approach. The allocation strategies taken into account are the random storage and a multi-criteria approach, called Interval-Value TOPSIS (IV-T), which is expressively proposed in this paper as a new way to solve the storage allocation problem of items in a warehouse. Because of the …
Value preserving portfolio strategies in continuous-time models
1997
We present a new approach for continuous-time portfolio strategies that relies on the principle of value preservation. This principle was developed by Hellwig (1987) for general economic decision and pricing models. The key idea is that an investor should try to consume only so much of his portfolio return that the future ability of the portfolio should be kept constant over time. This ensures that the portfolio will be a long lasting source of income. We define a continuous-time market setting to apply the idea of Hellwig to securities markets with continuous trading and examine existence (and uniqueness) of value-preserving strategies in some widely used market models. Further, we discuss…
Looking for the best modes helps solving the MRCPSP/max
2013
The multi-mode resource-constrained project scheduling problem with minimum and maximum time lags MRCPSP/max is a very general project scheduling problem with multiple execution modes per activity, renewable and non-renewable resources and minimum and maximum time lags between activities. In this paper, we describe SA-EVA, an algorithm for the problem. SA-EVA first searches for the best mode for each activity, without considering renewable resources. In this phase a simulated annealing is applied. Once a mode vector has been chosen, the problem reduces to the RCPSP/max, which SA-EVA solves with EVA, an algorithm designed in Ballestin et al. [2009. An evolutionary algorithm for the resource-…
Approximation algorithm for constrained coupled-tasks scheduling problem
2014
International audience; We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. In such context, we propose some complexity results according to several parameters and we design an efficient polynomial-time approximation algorithm.
An approximate/exact objective based search technique for solving general scheduling problems
2018
Abstract In this paper, we analyze single machine scheduling problems under the following minimization objectives: the maximum completion time (makespan), the total completion time and the maximum lateness, including fundamental practical aspects, which often occur in industrial or manufacturing reality: release dates, due dates, setup times, precedence constraints, deterioration (aging) of machines, as well as maintenance activities. To solve the problems, we propose an efficient representation of a solution and a fast neighborhood search technique, which calculates an approximation of criterion values in a constant time per solution in a neighborhood. On this basis, a novel approximate/ex…
Two Job Cyclic Scheduling with Incompatibility Constraints
2001
The present paper deals with the problem of scheduling several repeated occurrences of two jobs over a finite or infinite time horizon in order to maximize the yielded profit. The constraints of the problem are the incompatibilities between some pairs of tasks which require a same resource.
Time and work generalised precedence relationships in project scheduling with pre-emption: An application to the management of Service Centres
2012
Abstract In this paper we present an application of project scheduling concepts and solution procedures for the solution of a complex problem that comes up in the daily management of many company Service Centres. The real problem has been modelled as a multi-mode resource-constrained project scheduling problem with pre-emption, time and work generalised precedence relationships with minimal and maximal time lags between the tasks and due dates. We present a complete study of work GPRs which includes proper definitions, a new notation and all possible conversions amongst them. Computational results that show the efficiency of the proposed hybrid genetic algorithm and the advantages of allowi…