Dépouillements

Developing geographical indicators of mileage-related costs / Hindle, G. A. in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 714–722 Titre : Developing geographical indicators of mileage-related costs : a case study exploring travelling public services in English local areas Type de document : texte imprimé Auteurs : Hindle, G. A., Auteur ; A. Hindle, Auteur Année de publication : 2010 Article en page(s) : pp. 714–722 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Public  expenditure  Government  Regional  studies  Regression  Transport Index. décimale : 001.424 Résumé : The context of this study is the public sector provision of services involving travelling in local authority areas in England. Such travelling services are costly and the relative levels of these costs across different local areas have raised a number of policy issues, particularly how performance assessments of local authorities and capitation-based funding by central government take into account (or fail to take into account) the differential travel costs faced in geographical areas that differ in population dispersion (sparsity) characteristics. The research presented here is concerned with identifying and evaluating practical indicators of mileage-related costs faced in local areas and a range of indicators have been explored for three services: domiciliary care, refuse collection and home-to-school transport. The findings suggest that currently used population dispersion indicators could be improved and that the current sparsity allowances in England underestimate the relative cost effects by a considerable amount. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200921a.html [article] Developing geographical indicators of mileage-related costs : a case study exploring travelling public services in English local areas [texte imprimé] / Hindle, G. A., Auteur ; A. Hindle, Auteur . - 2010 . - pp. 714–722. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 714–722 Mots-clés : Public  expenditure  Government  Regional  studies  Regression  Transport Index. décimale : 001.424 Résumé : The context of this study is the public sector provision of services involving travelling in local authority areas in England. Such travelling services are costly and the relative levels of these costs across different local areas have raised a number of policy issues, particularly how performance assessments of local authorities and capitation-based funding by central government take into account (or fail to take into account) the differential travel costs faced in geographical areas that differ in population dispersion (sparsity) characteristics. The research presented here is concerned with identifying and evaluating practical indicators of mileage-related costs faced in local areas and a range of indicators have been explored for three services: domiciliary care, refuse collection and home-to-school transport. The findings suggest that currently used population dispersion indicators could be improved and that the current sparsity allowances in England underestimate the relative cost effects by a considerable amount. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200921a.html

Models and algorithms for the scheduling of a doubles tennis training tournament / A. Ghoniem in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 723–731 Titre : Models and algorithms for the scheduling of a doubles tennis training tournament Type de document : texte imprimé Auteurs : A. Ghoniem, Auteur ; D. Sherali, Auteur Année de publication : 2010 Article en page(s) : pp. 723–731 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Sports  scheduling  0–1  mixed-integer  programming  Symmetry-defeating  constraints  Modelling  and  optimization Index. décimale : 001.424 Résumé : We address a doubles tennis scheduling problem in the context of a training tournament, and develop a 0–1 mixed-integer programming model that attempts to balance the partnership and the opponentship pairings among the players. We propose effective symmetry-defeating strategies that impose certain decision hierarchies within the model, which serve to significantly enhance algorithmic performance via their pruning effect. We also discuss the concept of symmetry compatible formulations, and highlight the importance of crafting formulations in discrete optimization in a fashion that enhances the interplay between the original model structure, branch-and-bound algorithms (as implemented in commercial packages such as CPLEX), and the structure of specific symmetry-defeating hierarchical constraints. Finally, various specialized heuristics are devised and are computationally evaluated along with the exact solution schemes using a set of realistic practical test problems. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors2008190a.html [article] Models and algorithms for the scheduling of a doubles tennis training tournament [texte imprimé] / A. Ghoniem, Auteur ; D. Sherali, Auteur . - 2010 . - pp. 723–731. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 723–731 Mots-clés : Sports  scheduling  0–1  mixed-integer  programming  Symmetry-defeating  constraints  Modelling  and  optimization Index. décimale : 001.424 Résumé : We address a doubles tennis scheduling problem in the context of a training tournament, and develop a 0–1 mixed-integer programming model that attempts to balance the partnership and the opponentship pairings among the players. We propose effective symmetry-defeating strategies that impose certain decision hierarchies within the model, which serve to significantly enhance algorithmic performance via their pruning effect. We also discuss the concept of symmetry compatible formulations, and highlight the importance of crafting formulations in discrete optimization in a fashion that enhances the interplay between the original model structure, branch-and-bound algorithms (as implemented in commercial packages such as CPLEX), and the structure of specific symmetry-defeating hierarchical constraints. Finally, various specialized heuristics are devised and are computationally evaluated along with the exact solution schemes using a set of realistic practical test problems. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors2008190a.html

Using dynamic programming to determine an optimal strategy in a contract bridge tournament / N. Beaumont in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 732–739 Titre : Using dynamic programming to determine an optimal strategy in a contract bridge tournament Type de document : texte imprimé Auteurs : N. Beaumont, Auteur Année de publication : 2010 Article en page(s) : pp. 732–739 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Dynamic  programming  Sports  Recreation  Optimization  Contract  bridge  Deliberately  losing Index. décimale : 001.424 Résumé : One form of contract bridge tournament comprises several rounds of matches in which players compete as pairs for ‘masterpoints’ awarded for each match won or drawn and for being highly placed at the end of the tournament. In the second and subsequent rounds, pairs are matched against other pairs that have been approximately equally successful so far. There has been vague discussion among bridge players of the possible advantages of ‘throwing’, that is, deliberately losing a match in round r so as to obtain a lower ranking and face an easier opponent in round r+1. This paper uses dynamic programming and data from one tournament to identify an optimal strategy (either ‘throw’ or ‘play to win’). The optimal strategy is a function of a pair's ability, its placing after each round, the relative rewards for winning a match and finishing high, the opponent's skill, and the round. For example, we find that a very weak pair should ‘throw’ and ‘play to win’ in alternate rounds. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200941a.html [article] Using dynamic programming to determine an optimal strategy in a contract bridge tournament [texte imprimé] / N. Beaumont, Auteur . - 2010 . - pp. 732–739. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 732–739 Mots-clés : Dynamic  programming  Sports  Recreation  Optimization  Contract  bridge  Deliberately  losing Index. décimale : 001.424 Résumé : One form of contract bridge tournament comprises several rounds of matches in which players compete as pairs for ‘masterpoints’ awarded for each match won or drawn and for being highly placed at the end of the tournament. In the second and subsequent rounds, pairs are matched against other pairs that have been approximately equally successful so far. There has been vague discussion among bridge players of the possible advantages of ‘throwing’, that is, deliberately losing a match in round r so as to obtain a lower ranking and face an easier opponent in round r+1. This paper uses dynamic programming and data from one tournament to identify an optimal strategy (either ‘throw’ or ‘play to win’). The optimal strategy is a function of a pair's ability, its placing after each round, the relative rewards for winning a match and finishing high, the opponent's skill, and the round. For example, we find that a very weak pair should ‘throw’ and ‘play to win’ in alternate rounds. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200941a.html

An ANP framework for property pricing combining quantitative and qualitative attributes / J. Aznar in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 740–755 Titre : An ANP framework for property pricing combining quantitative and qualitative attributes Type de document : texte imprimé Auteurs : J. Aznar, Auteur ; J. Ferrís-Oñate, Auteur ; F. Guijarro, Auteur Année de publication : 2010 Article en page(s) : pp. 740–755 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Multicriteria  valuation  Urban  appraisal  AHP  ANP  Goal  programming Index. décimale : 001.424 Résumé : This paper presents a new comparative methodology for the valuation of urban properties based on the Analytic Network Process (ANP), with the twin objective of overcoming the drawbacks found in classical urban valuation methods and enhancing the current set of tools available for the appraiser. The ANP enables to tackle contexts in which scant information is available, qualitative variables are considered and, unlike the Analytic Hierarchy Process, interdependences among variables are present, all very common situations in professional valuation practice, so this study proposes its application to the field of urban valuation. To illustrate the new proposal, a real case study is put forward alongside four different models for solving it, with the aim of analysing the varying accuracy of each model. It may be concluded that the more information taken into account in relation to the interdependences between criteria and alternatives, the greater the accuracy of the results. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200931a.html [article] An ANP framework for property pricing combining quantitative and qualitative attributes [texte imprimé] / J. Aznar, Auteur ; J. Ferrís-Oñate, Auteur ; F. Guijarro, Auteur . - 2010 . - pp. 740–755. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 740–755 Mots-clés : Multicriteria  valuation  Urban  appraisal  AHP  ANP  Goal  programming Index. décimale : 001.424 Résumé : This paper presents a new comparative methodology for the valuation of urban properties based on the Analytic Network Process (ANP), with the twin objective of overcoming the drawbacks found in classical urban valuation methods and enhancing the current set of tools available for the appraiser. The ANP enables to tackle contexts in which scant information is available, qualitative variables are considered and, unlike the Analytic Hierarchy Process, interdependences among variables are present, all very common situations in professional valuation practice, so this study proposes its application to the field of urban valuation. To illustrate the new proposal, a real case study is put forward alongside four different models for solving it, with the aim of analysing the varying accuracy of each model. It may be concluded that the more information taken into account in relation to the interdependences between criteria and alternatives, the greater the accuracy of the results. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200931a.html

Adapting and refining in multi-criteria decision-making / D. B. O'Brien in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 756–767 Titre : Adapting and refining in multi-criteria decision-making Type de document : texte imprimé Auteurs : D. B. O'Brien, Auteur ; C. M. Brugha, Auteur Année de publication : 2010 Article en page(s) : pp. 756–767 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Methodology  Multi-objective  Philosophy  Problem  structuring  Decision  analysis  Practice  of  OR Index. décimale : 001.424 Résumé : This paper describes the implementation of a Structured Methodology for Direct-Interactive Structured-Criteria (DISC) Multi-Criteria Decision-Making (MCDM), an eight-stage nomological adjusting cycle of activities that shape the information used to make a decision, requiring it be accessible, differentiable, abstractable, understandable, verifiable, measurable, refinable and usable. It shows, in a major IT strategic investment case, that Structured DISC MCDM provides a robust model that can be used for deep and serious consideration of multi-criteria decisions by a group of decision-makers over a long period. The paper describes the case as it moves through stages of the adjusting cycle and shows that, after completing the cycle, it reverses and becomes an adapting process, starting with refining the information. Refining is shown to be more extensive than previously understood, and to cover ‘alternatives & scores’, ‘criteria & weights’ and ‘set of alternatives’. Next the form of measurement is adapted. As the number of alternatives are reduced it can become more appropriate to directly compare the two or three most preferred alternatives relative to one another rather than objectively. Finally the criteria tree can be adapted using a ‘magnifying glass’ approach. This confines the evaluation to that part of the criteria tree in which the difference between a few preferred alternatives is mainly emphasised. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200982a.html [article] Adapting and refining in multi-criteria decision-making [texte imprimé] / D. B. O'Brien, Auteur ; C. M. Brugha, Auteur . - 2010 . - pp. 756–767. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 756–767 Mots-clés : Methodology  Multi-objective  Philosophy  Problem  structuring  Decision  analysis  Practice  of  OR Index. décimale : 001.424 Résumé : This paper describes the implementation of a Structured Methodology for Direct-Interactive Structured-Criteria (DISC) Multi-Criteria Decision-Making (MCDM), an eight-stage nomological adjusting cycle of activities that shape the information used to make a decision, requiring it be accessible, differentiable, abstractable, understandable, verifiable, measurable, refinable and usable. It shows, in a major IT strategic investment case, that Structured DISC MCDM provides a robust model that can be used for deep and serious consideration of multi-criteria decisions by a group of decision-makers over a long period. The paper describes the case as it moves through stages of the adjusting cycle and shows that, after completing the cycle, it reverses and becomes an adapting process, starting with refining the information. Refining is shown to be more extensive than previously understood, and to cover ‘alternatives & scores’, ‘criteria & weights’ and ‘set of alternatives’. Next the form of measurement is adapted. As the number of alternatives are reduced it can become more appropriate to directly compare the two or three most preferred alternatives relative to one another rather than objectively. Finally the criteria tree can be adapted using a ‘magnifying glass’ approach. This confines the evaluation to that part of the criteria tree in which the difference between a few preferred alternatives is mainly emphasised. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200982a.html

Modelling the size and skill-mix of hospital nursing teams / P. R. Harper in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 768–779 Titre : Modelling the size and skill-mix of hospital nursing teams Type de document : texte imprimé Auteurs : P. R. Harper, Auteur ; N. H. Powell, Auteur ; J. E. Williams, Auteur Année de publication : 2010 Article en page(s) : pp. 768–779 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Simulation  Stochastic  programming  Healthcare  modelling  Nurse  skill-mix Index. décimale : 001.424 Résumé : Previously published work has described the development of a hospital capacity simulation tool, PROMPT. PROMPT has now been adopted by a number of hospitals in the UK and is used for both strategic and operational planning and management of key hospital resources. The work, as presented here, extends the PROMPT functionality to consider in more detail workforce issues. In particular, working with some of the current hospital users, the research has focussed on detailed planning for calculating the size and skill-mix of inpatient nursing teams. The chosen methodology utilizes both simulation and optimization. Outputs from the PROMPT three-phase discrete event simulation are fed into a stochastic programme which suggests the optimal number of nurses to employ (whole time equivalents) by skill-mix and the corresponding numbers by shift. A novel feature of the tool is the ability to predict and compare nursing needs based on different methods of capturing patient-to-nurse ratios as currently adopted across the UK National Health Service. Illustrative results from one hospital demonstrate that although the overall sizes of nursing teams on different wards are of an acceptable level and comparable to the outputs from the simulation phase of the work, often the number of nurses employed at different grades is not well matched to patient needs and the skill-mix should be reconsidered. Results from the optimization phase of the work suggest that it is cost beneficial to increase the number of permanently employed nurses to account for fluctuations in demand and corresponding high costs of temporary (agency) nurses. The scenario functionality of the tool permits for the study of changing size and skill-mix as a consequence of changes in patient volumes, patient case-mix, numbers of beds and length of stay. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200943a.html [article] Modelling the size and skill-mix of hospital nursing teams [texte imprimé] / P. R. Harper, Auteur ; N. H. Powell, Auteur ; J. E. Williams, Auteur . - 2010 . - pp. 768–779. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 768–779 Mots-clés : Simulation  Stochastic  programming  Healthcare  modelling  Nurse  skill-mix Index. décimale : 001.424 Résumé : Previously published work has described the development of a hospital capacity simulation tool, PROMPT. PROMPT has now been adopted by a number of hospitals in the UK and is used for both strategic and operational planning and management of key hospital resources. The work, as presented here, extends the PROMPT functionality to consider in more detail workforce issues. In particular, working with some of the current hospital users, the research has focussed on detailed planning for calculating the size and skill-mix of inpatient nursing teams. The chosen methodology utilizes both simulation and optimization. Outputs from the PROMPT three-phase discrete event simulation are fed into a stochastic programme which suggests the optimal number of nurses to employ (whole time equivalents) by skill-mix and the corresponding numbers by shift. A novel feature of the tool is the ability to predict and compare nursing needs based on different methods of capturing patient-to-nurse ratios as currently adopted across the UK National Health Service. Illustrative results from one hospital demonstrate that although the overall sizes of nursing teams on different wards are of an acceptable level and comparable to the outputs from the simulation phase of the work, often the number of nurses employed at different grades is not well matched to patient needs and the skill-mix should be reconsidered. Results from the optimization phase of the work suggest that it is cost beneficial to increase the number of permanently employed nurses to account for fluctuations in demand and corresponding high costs of temporary (agency) nurses. The scenario functionality of the tool permits for the study of changing size and skill-mix as a consequence of changes in patient volumes, patient case-mix, numbers of beds and length of stay. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200943a.html

Optimal multi-period service capacity allocation and pricing allowing for uncertain competitive entry / H. Zhang in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 780–789 Titre : Optimal multi-period service capacity allocation and pricing allowing for uncertain competitive entry Type de document : texte imprimé Auteurs : H. Zhang, Auteur ; H. I. Mesak, Auteur Année de publication : 2010 Article en page(s) : pp. 780–789 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Capacity  allocation  Nonlinear  programming  Pricing  Service  operations  Simulation Index. décimale : 001.424 Résumé : A nonlinear programming model is formulated in this paper to determine the optimal scheme of capacity allocation and prices over a multi-period planning horizon for a service provider in the absence and presence of uncertain competitive entry. The model is solved for constant, decreasing, and increasing price sensitivities employing a combination of analytical and numerical methods. The study highlights the importance of advance selling of service prior to its eventual consumption in the spot period and investigates the impact of uncertain competitive entry on the optimal capacity allocation policy and its related profit if the entry is more or less likely or if the rival is more or less influential. The findings of the study reveal that the conclusions drawn from a two-period model are not necessarily generalizable to a model of a multi-period planning horizon. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200929a.html [article] Optimal multi-period service capacity allocation and pricing allowing for uncertain competitive entry [texte imprimé] / H. Zhang, Auteur ; H. I. Mesak, Auteur . - 2010 . - pp. 780–789. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 780–789 Mots-clés : Capacity  allocation  Nonlinear  programming  Pricing  Service  operations  Simulation Index. décimale : 001.424 Résumé : A nonlinear programming model is formulated in this paper to determine the optimal scheme of capacity allocation and prices over a multi-period planning horizon for a service provider in the absence and presence of uncertain competitive entry. The model is solved for constant, decreasing, and increasing price sensitivities employing a combination of analytical and numerical methods. The study highlights the importance of advance selling of service prior to its eventual consumption in the spot period and investigates the impact of uncertain competitive entry on the optimal capacity allocation policy and its related profit if the entry is more or less likely or if the rival is more or less influential. The findings of the study reveal that the conclusions drawn from a two-period model are not necessarily generalizable to a model of a multi-period planning horizon. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200929a.html

The effect of lifetime buys on warranty repair operations / K. Sahyouni in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 790–803 Titre : The effect of lifetime buys on warranty repair operations Type de document : texte imprimé Auteurs : K. Sahyouni, Auteur ; R. C. Savaskan, Auteur ; M. S. Daskin, Auteur Année de publication : 2010 Article en page(s) : pp. 790–803 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Logistics  Inventory  Repair Index. décimale : 001.424 Résumé : Lifetime buys are a common practice in the electronics and telecommunication industries. Under this practice, manufacturers procure their repair parts inventory in one order to support the spare part needs of a product for the duration of its warranty repair period. In this paper, we consider a repair operation in which defective items under warranty are returned to a manufacturer who either repairs these items using its spare parts inventory or replaces each defective unit with a new product. We show how fixed repair capability costs, variable repair costs, inventory holding costs, and replacement costs affect a firm's optimal repair and replacement decisions. The model is used to gain insights for products from a major mobile device manufacturer in the United States. DEWEY : 001.424 ISSN : 0361-5682 En ligne : www.palgrave-journals.com/jors/journal/v61/n5/abs/jors2008143a.html [article] The effect of lifetime buys on warranty repair operations [texte imprimé] / K. Sahyouni, Auteur ; R. C. Savaskan, Auteur ; M. S. Daskin, Auteur . - 2010 . - pp. 790–803. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 790–803 Mots-clés : Logistics  Inventory  Repair Index. décimale : 001.424 Résumé : Lifetime buys are a common practice in the electronics and telecommunication industries. Under this practice, manufacturers procure their repair parts inventory in one order to support the spare part needs of a product for the duration of its warranty repair period. In this paper, we consider a repair operation in which defective items under warranty are returned to a manufacturer who either repairs these items using its spare parts inventory or replaces each defective unit with a new product. We show how fixed repair capability costs, variable repair costs, inventory holding costs, and replacement costs affect a firm's optimal repair and replacement decisions. The model is used to gain insights for products from a major mobile device manufacturer in the United States. DEWEY : 001.424 ISSN : 0361-5682 En ligne : www.palgrave-journals.com/jors/journal/v61/n5/abs/jors2008143a.html

Heuristics for feature selection in mathematical programming discriminant analysis models / K. Falangis in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 804–812 Titre : Heuristics for feature selection in mathematical programming discriminant analysis models Type de document : texte imprimé Auteurs : K. Falangis, Auteur ; Glen, J. J., Auteur Année de publication : 2010 Article en page(s) : pp. 804–812 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Discriminant  analysi  Mmathematical  programming  Credit  scoring Index. décimale : 001.424 Résumé : In developing a classification model for assigning observations of unknown class to one of a number of specified classes using the values of a set of features associated with each observation, it is often desirable to base the classifier on a limited number of features. Mathematical programming discriminant analysis methods for developing classification models can be extended for feature selection. Classification accuracy can be used as the feature selection criterion by using a mixed integer programming (MIP) model in which a binary variable is associated with each training sample observation, but the binary variable requirements limit the size of problems to which this approach can be applied. Heuristic feature selection methods for problems with large numbers of observations are developed in this paper. These heuristic procedures, which are based on the MIP model for maximizing classification accuracy, are then applied to three credit scoring data sets. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200924a.html [article] Heuristics for feature selection in mathematical programming discriminant analysis models [texte imprimé] / K. Falangis, Auteur ; Glen, J. J., Auteur . - 2010 . - pp. 804–812. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 804–812 Mots-clés : Discriminant  analysi  Mmathematical  programming  Credit  scoring Index. décimale : 001.424 Résumé : In developing a classification model for assigning observations of unknown class to one of a number of specified classes using the values of a set of features associated with each observation, it is often desirable to base the classifier on a limited number of features. Mathematical programming discriminant analysis methods for developing classification models can be extended for feature selection. Classification accuracy can be used as the feature selection criterion by using a mixed integer programming (MIP) model in which a binary variable is associated with each training sample observation, but the binary variable requirements limit the size of problems to which this approach can be applied. Heuristic feature selection methods for problems with large numbers of observations are developed in this paper. These heuristic procedures, which are based on the MIP model for maximizing classification accuracy, are then applied to three credit scoring data sets. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200924a.html

A fuzzy greedy heuristic for permutation flow-shop scheduling / K. Sheibani in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 813–818 Titre : A fuzzy greedy heuristic for permutation flow-shop scheduling Type de document : texte imprimé Auteurs : K. Sheibani, Auteur Année de publication : 2010 Article en page(s) : pp. 813–818 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Combinatorial  optimization  Flow-shop  scheduling  Heuristics Index. décimale : 001.424 Résumé : This paper describes a polynomial-time heuristic for the permutation flow-shop scheduling problem with the makespan criterion. The proposed method consists of two phases: arranging the jobs in priority order and then constructing a sequence. A fuzzy greedy evaluation function is employed to prioritize the jobs for incorporating into the construction phase of the heuristic. Computational experiments using standard benchmark problems indicate an improvement of the new heuristic over the well-known Nawaz, Enscore and Ham (NEH) heuristic. It will be seen that the NEH heuristic is a special case of our more general heuristic. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors2008194a.html [article] A fuzzy greedy heuristic for permutation flow-shop scheduling [texte imprimé] / K. Sheibani, Auteur . - 2010 . - pp. 813–818. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 813–818 Mots-clés : Combinatorial  optimization  Flow-shop  scheduling  Heuristics Index. décimale : 001.424 Résumé : This paper describes a polynomial-time heuristic for the permutation flow-shop scheduling problem with the makespan criterion. The proposed method consists of two phases: arranging the jobs in priority order and then constructing a sequence. A fuzzy greedy evaluation function is employed to prioritize the jobs for incorporating into the construction phase of the heuristic. Computational experiments using standard benchmark problems indicate an improvement of the new heuristic over the well-known Nawaz, Enscore and Ham (NEH) heuristic. It will be seen that the NEH heuristic is a special case of our more general heuristic. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors2008194a.html

Ant Local Search and its efficient adaptation to graph colouring / M. Plumettaz in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 819–826 Titre : Ant Local Search and its efficient adaptation to graph colouring Type de document : texte imprimé Auteurs : M. Plumettaz, Auteur ; D. Schindl, Auteur ; N. Zufferey, Auteur Année de publication : 2010 Article en page(s) : pp. 819–826 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Heuristics  Networks  and  graphs  Artificial  life  Optimization Index. décimale : 001.424 Résumé : In this paper, we propose a new kind of ant algorithm called Ant Local Search. In most ant algorithms, the role of each ant is to build a solution in a constructive way. In contrast, we propose to consider each ant as a local search, where at each step and in concordance with all ant algorithms, each ant modifies the current solution by the use of the greedy force and the trail systems. We also propose ways to reduce the computational effort associated with each ant decision. Such a new and general ant methodology is then applied to the well-known k-colouring problem, which is NP-hard. Computational experiments give evidence that our algorithm is competitive with the best colouring methods. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200927a.html [article] Ant Local Search and its efficient adaptation to graph colouring [texte imprimé] / M. Plumettaz, Auteur ; D. Schindl, Auteur ; N. Zufferey, Auteur . - 2010 . - pp. 819–826. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 819–826 Mots-clés : Heuristics  Networks  and  graphs  Artificial  life  Optimization Index. décimale : 001.424 Résumé : In this paper, we propose a new kind of ant algorithm called Ant Local Search. In most ant algorithms, the role of each ant is to build a solution in a constructive way. In contrast, we propose to consider each ant as a local search, where at each step and in concordance with all ant algorithms, each ant modifies the current solution by the use of the greedy force and the trail systems. We also propose ways to reduce the computational effort associated with each ant decision. Such a new and general ant methodology is then applied to the well-known k-colouring problem, which is NP-hard. Computational experiments give evidence that our algorithm is competitive with the best colouring methods. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200927a.html

Models for cellular manufacturing systems design / R. Bhatnagar in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 827–839 Titre : Models for cellular manufacturing systems design : matching processing requirements and operator capabilities Type de document : texte imprimé Auteurs : R. Bhatnagar, Auteur ; V. Saddikuti, Auteur Année de publication : 2010 Article en page(s) : pp. 827–839 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Cellular  manufacturing  systems  Layout  Optimization  Production  Planning  Heuristics Index. décimale : 001.424 Résumé : Cellular manufacturing systems comprise categorizing machines used in the firm's production system into cells dedicated to part families that have similar requirements in terms of tooling, setups and operations sequences. Although worker assignment to cells has a significant impact on cell effectiveness, scant attention has been paid to this issue in previous research. We present two models—sequential and concurrent—for cell formation. The sequential model uses a machine–part incidence matrix (MPIM)-based similarity coefficient while the concurrent model uses a similarity coefficient based on both MPIM and machine–operator incidence matrix (MOIM). Our results show that for 50 problem sets widely reported in literature, the concurrent model outperformed the sequential model in most cases. A measure quantifying the difference in MPIM and MOIM was developed and the relative out-performance of the concurrent model was shown to depend on the value of this measure. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors2008181a.html [article] Models for cellular manufacturing systems design : matching processing requirements and operator capabilities [texte imprimé] / R. Bhatnagar, Auteur ; V. Saddikuti, Auteur . - 2010 . - pp. 827–839. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 827–839 Mots-clés : Cellular  manufacturing  systems  Layout  Optimization  Production  Planning  Heuristics Index. décimale : 001.424 Résumé : Cellular manufacturing systems comprise categorizing machines used in the firm's production system into cells dedicated to part families that have similar requirements in terms of tooling, setups and operations sequences. Although worker assignment to cells has a significant impact on cell effectiveness, scant attention has been paid to this issue in previous research. We present two models—sequential and concurrent—for cell formation. The sequential model uses a machine–part incidence matrix (MPIM)-based similarity coefficient while the concurrent model uses a similarity coefficient based on both MPIM and machine–operator incidence matrix (MOIM). Our results show that for 50 problem sets widely reported in literature, the concurrent model outperformed the sequential model in most cases. A measure quantifying the difference in MPIM and MOIM was developed and the relative out-performance of the concurrent model was shown to depend on the value of this measure. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors2008181a.html

The loader problem / G. Tang in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 840–848 Titre : The loader problem : formulation, complexity and algorithms Type de document : texte imprimé Auteurs : G. Tang, Auteur ; F. Chen, Auteur ; Cheng, T. C. E., Auteur Année de publication : 2010 Article en page(s) : pp. 840–848 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Loader  problem  Integer  programming  Logistics  NP-hard  Algorithms Index. décimale : 001.424 Résumé : In this paper we consider a new transportation model, called the loader problem, which is frequently encountered by third-party logistics service providers in practice. It is a tactical staff-planning problem with the objective of minimizing the total labour cost of staffing a sufficient number of loaders on a given fleet of trucks that serve a given set of customer sites. We formulate the problem as an integer program and show that it is strongly NP-hard. We then consider two special cases of the loader problem that occur in certain practical situations, and propose polynomial and pseudo-polynomial time algorithms for solving these cases. We also propose a linear programming relaxation-based random rounding algorithm for the general problem and report the computational results of the algorithm. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200955a.html [article] The loader problem : formulation, complexity and algorithms [texte imprimé] / G. Tang, Auteur ; F. Chen, Auteur ; Cheng, T. C. E., Auteur . - 2010 . - pp. 840–848. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 840–848 Mots-clés : Loader  problem  Integer  programming  Logistics  NP-hard  Algorithms Index. décimale : 001.424 Résumé : In this paper we consider a new transportation model, called the loader problem, which is frequently encountered by third-party logistics service providers in practice. It is a tactical staff-planning problem with the objective of minimizing the total labour cost of staffing a sufficient number of loaders on a given fleet of trucks that serve a given set of customer sites. We formulate the problem as an integer program and show that it is strongly NP-hard. We then consider two special cases of the loader problem that occur in certain practical situations, and propose polynomial and pseudo-polynomial time algorithms for solving these cases. We also propose a linear programming relaxation-based random rounding algorithm for the general problem and report the computational results of the algorithm. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200955a.html

Parallel machine scheduling problems considering regular measures of performance and machine cost / A. J. Ruiz-Torres in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 849–857 Titre : Parallel machine scheduling problems considering regular measures of performance and machine cost Type de document : texte imprimé Auteurs : A. J. Ruiz-Torres, Auteur ; F. J. López, Auteur ; P. J. Wojciechowski, Auteur Année de publication : 2010 Article en page(s) : pp. 849–857 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Multi-objective  criteria  Parallel  machines  Machine  utilization  Pareto  solutions Index. décimale : 001.424 Résumé : This research considers a broad range of scheduling problems in the parallel machines environment. Schedules are evaluated according to two independent components of the objective function: (1) machine cost consisting of a fixed cost and a variable cost; and (2) a regular measure of performance. This study is only one of a few that take the selection of machines among those available as a decision variable. For machine cost with concave functions, we derive the general characteristics of optimal solutions with respect to decisions on the number of machines to use and the way to load the machines. Our analysis is not restricted to the machine cost criterion, but may be extended to other measures with concave functions. Furthermore, we provide a Pareto efficient perspective in understanding the tradeoff between machine cost and any regular measure of performance. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200938a.html [article] Parallel machine scheduling problems considering regular measures of performance and machine cost [texte imprimé] / A. J. Ruiz-Torres, Auteur ; F. J. López, Auteur ; P. J. Wojciechowski, Auteur . - 2010 . - pp. 849–857. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 849–857 Mots-clés : Scheduling  Multi-objective  criteria  Parallel  machines  Machine  utilization  Pareto  solutions Index. décimale : 001.424 Résumé : This research considers a broad range of scheduling problems in the parallel machines environment. Schedules are evaluated according to two independent components of the objective function: (1) machine cost consisting of a fixed cost and a variable cost; and (2) a regular measure of performance. This study is only one of a few that take the selection of machines among those available as a decision variable. For machine cost with concave functions, we derive the general characteristics of optimal solutions with respect to decisions on the number of machines to use and the way to load the machines. Our analysis is not restricted to the machine cost criterion, but may be extended to other measures with concave functions. Furthermore, we provide a Pareto efficient perspective in understanding the tradeoff between machine cost and any regular measure of performance. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200938a.html

Analysing the impact of the implementation of lean manufacturing strategies on profitability / D. J. Meade in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 858–871 Titre : Analysing the impact of the implementation of lean manufacturing strategies on profitability Type de document : texte imprimé Auteurs : D. J. Meade, Auteur ; Kumar, S., Auteur ; B. White, Auteur Année de publication : 2010 Article en page(s) : pp. 858–871 Note générale : Recherche Opérationnelle Langues : Anglais (eng) Mots-clés : Accounting  Cost  allocation  Inventory  Lean  manufacturing  Simulation  Stochastic  processes Index. décimale : 001.424 Résumé : Under standard cost accounting systems, reductions in inventories lead to falling reported profits. Rapid reductions in inventories intensify the impact to the bottom line. When a company embarks on an improvement programme such as lean manufacturing, a likely result will be an initial drop in reported profits due to the leaning out of inventories. This paper examines the impact of the adoption of such strategies on the key external financial performance measure of net profit as reported by the GAAP and SEC approved financial accounting methods and others. ANOVA analysis of data generated using a simulated manufacturing environment that includes a discrete event model of a manufacturing operation and a Microsoft Excel-based ERP system are discussed. The paper analyses both the magnitude of the reduction in reported profits and the span of reporting periods affected under three inventory reduction scenarios. This research was not concerned with finding justification for lean manufacturing strategies. Rather, it evaluates the inadequacies of standard financial reporting methods to accurately reflect operational improvements through the early stages of a lean programme. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/2602657a.html [article] Analysing the impact of the implementation of lean manufacturing strategies on profitability [texte imprimé] / D. J. Meade, Auteur ; Kumar, S., Auteur ; B. White, Auteur . - 2010 . - pp. 858–871. Recherche Opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 858–871 Mots-clés : Accounting  Cost  allocation  Inventory  Lean  manufacturing  Simulation  Stochastic  processes Index. décimale : 001.424 Résumé : Under standard cost accounting systems, reductions in inventories lead to falling reported profits. Rapid reductions in inventories intensify the impact to the bottom line. When a company embarks on an improvement programme such as lean manufacturing, a likely result will be an initial drop in reported profits due to the leaning out of inventories. This paper examines the impact of the adoption of such strategies on the key external financial performance measure of net profit as reported by the GAAP and SEC approved financial accounting methods and others. ANOVA analysis of data generated using a simulated manufacturing environment that includes a discrete event model of a manufacturing operation and a Microsoft Excel-based ERP system are discussed. The paper analyses both the magnitude of the reduction in reported profits and the span of reporting periods affected under three inventory reduction scenarios. This research was not concerned with finding justification for lean manufacturing strategies. Rather, it evaluates the inadequacies of standard financial reporting methods to accurately reflect operational improvements through the early stages of a lean programme. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/2602657a.html

A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems / S. Özpeynirci in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 872–877 Titre : A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems Type de document : texte imprimé Auteurs : S. Özpeynirci, Auteur ; Azizoglu, M., Auteur Année de publication : 2010 Article en page(s) : pp. 872–877 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Lagrangean  relaxation  Flexible  manufacturing  systems  Tool  assignment  Computer  numerically  controlled  machines Index. décimale : 001.424 Résumé : This study considers the operation assignment and capacity allocation problem in flexible manufacturing systems. A set of operations is selected to be processed and assigned to the machines together with their required tools. The purchase or usage of the required tools incurs a cost. The machines have scarce time and tool magazine capacities. The objective is to maximize the total weight of the assigned operations minus the total tooling costs. We use Lagrangean relaxation approach to obtain upper and lower bounds on the optimal objective function values. The computational experiments show that our approach provides near optimal bounds in reasonable solution times. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200919a.html [article] A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems [texte imprimé] / S. Özpeynirci, Auteur ; Azizoglu, M., Auteur . - 2010 . - pp. 872–877. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 872–877 Mots-clés : Lagrangean  relaxation  Flexible  manufacturing  systems  Tool  assignment  Computer  numerically  controlled  machines Index. décimale : 001.424 Résumé : This study considers the operation assignment and capacity allocation problem in flexible manufacturing systems. A set of operations is selected to be processed and assigned to the machines together with their required tools. The purchase or usage of the required tools incurs a cost. The machines have scarce time and tool magazine capacities. The objective is to maximize the total weight of the assigned operations minus the total tooling costs. We use Lagrangean relaxation approach to obtain upper and lower bounds on the optimal objective function values. The computational experiments show that our approach provides near optimal bounds in reasonable solution times. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200919a.html

Covering continuous demand in the plane / Z. Drezner in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 878–881 Titre : Covering continuous demand in the plane Type de document : texte imprimé Auteurs : Z. Drezner, Auteur ; A. Suzuki, Auteur Année de publication : 2010 Article en page(s) : pp. 878–881 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Location  Cover  Circle  packing Index. décimale : 001.424 Résumé : Continuous demand is generated in a convex polygon. A facility located in the area covers demand within a given radius. The objective is to find the locations for p facilities that cover the maximum demand in the area. A procedure that calculates the total area covered by a set of facilities is developed. A multi start heuristic approach for solving this problem is proposed by applying a gradient search from a randomly generated set of p locations for the facilities. Computational experiments for covering a square area illustrate the effectiveness of the proposed algorithm. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200910a.html [article] Covering continuous demand in the plane [texte imprimé] / Z. Drezner, Auteur ; A. Suzuki, Auteur . - 2010 . - pp. 878–881. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 878–881 Mots-clés : Location  Cover  Circle  packing Index. décimale : 001.424 Résumé : Continuous demand is generated in a convex polygon. A facility located in the area covers demand within a given radius. The objective is to find the locations for p facilities that cover the maximum demand in the area. A procedure that calculates the total area covered by a set of facilities is developed. A multi start heuristic approach for solving this problem is proposed by applying a gradient search from a randomly generated set of p locations for the facilities. Computational experiments for covering a square area illustrate the effectiveness of the proposed algorithm. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200910a.html

Scheduling a deteriorating maintenance activity on a single machine / Mosheiov, G. in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. Titre : Scheduling a deteriorating maintenance activity on a single machine Type de document : texte imprimé Auteurs : Mosheiov, G., Auteur ; J. B. Sidney, Auteur Année de publication : 2010 Article en page(s) : pp. Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Single-machine  Maintenance  activity  Polynomial-time  solution Index. décimale : 001.424 Résumé : We study a problem of scheduling a maintenance activity on a single machine. Following several recent papers, the maintenance is assumed to be deteriorating, that is, delaying the maintenance increases the time required to perform it. The following objective functions are considered: makespan, flowtime, maximum lateness, total earliness, tardiness and due-date cost, and number of tardy jobs. We introduce polynomial time solutions for all these problems. DEWEY : 001.434 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors20095a.html [article] Scheduling a deteriorating maintenance activity on a single machine [texte imprimé] / Mosheiov, G., Auteur ; J. B. Sidney, Auteur . - 2010 . - pp. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. Mots-clés : Scheduling  Single-machine  Maintenance  activity  Polynomial-time  solution Index. décimale : 001.424 Résumé : We study a problem of scheduling a maintenance activity on a single machine. Following several recent papers, the maintenance is assumed to be deteriorating, that is, delaying the maintenance increases the time required to perform it. The following objective functions are considered: makespan, flowtime, maximum lateness, total earliness, tardiness and due-date cost, and number of tardy jobs. We introduce polynomial time solutions for all these problems. DEWEY : 001.434 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors20095a.html

Exemplaires

Bibliothèque Ecole Nationale Polytechnique d'Alger

Accueil

Se connecter

Météo

Adresse