Dépouillements

Mathematical description of a discrete event simulation (DEVS) using factor analytic method / J. Rodriquez in Journal of the operational research society (JORS), Vol. 63 N° 9 (Septembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1179–1188 Titre : Mathematical description of a discrete event simulation (DEVS) using factor analytic method Type de document : texte imprimé Auteurs : J. Rodriquez, Auteur ; J. O. Miller, Auteur ; K. W. Bauer, Auteur Année de publication : 2012 Article en page(s) : pp. 1179–1188 Note générale : Operational research Langues : Anglais (eng) Mots-clés : Networks  and  graphs  Simulation  Statistics Index. décimale : 001.424 Résumé : Appropriately capturing the logic or results of a detailed simulation through some kind of aggregation to pass up a model hierarchy is a difficult task. This aggregation task involves two main questions: ‘what’ to aggregate and ‘how’ to perform this aggregation. This paper provides a well-defined approach for the ‘what’ portion of the aggregation process for hierarchical simulation models. We start by characterizing a simulation model in a mathematical format. We then use this mathematical description to identify what portion of a lower-level model can be aggregated, or to capture the logical flow of the full lower-level model. A useful mathematical representation of the simulation structure and logic is through the development of a network representation of the model. This, in turn, can be systematically decomposed into smaller sub-networks by performing model decomposition by means of factor analytic methods, which is the main topic of discussion. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011107a.html [article] Mathematical description of a discrete event simulation (DEVS) using factor analytic method [texte imprimé] / J. Rodriquez, Auteur ; J. O. Miller, Auteur ; K. W. Bauer, Auteur . - 2012 . - pp. 1179–1188. Operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1179–1188 Mots-clés : Networks  and  graphs  Simulation  Statistics Index. décimale : 001.424 Résumé : Appropriately capturing the logic or results of a detailed simulation through some kind of aggregation to pass up a model hierarchy is a difficult task. This aggregation task involves two main questions: ‘what’ to aggregate and ‘how’ to perform this aggregation. This paper provides a well-defined approach for the ‘what’ portion of the aggregation process for hierarchical simulation models. We start by characterizing a simulation model in a mathematical format. We then use this mathematical description to identify what portion of a lower-level model can be aggregated, or to capture the logical flow of the full lower-level model. A useful mathematical representation of the simulation structure and logic is through the development of a network representation of the model. This, in turn, can be systematically decomposed into smaller sub-networks by performing model decomposition by means of factor analytic methods, which is the main topic of discussion. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011107a.html

Towards an auction-driven gas supply / F. J. Otamendi in Journal of the operational research society (JORS), Vol. 63 N° 9 (Septembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1189–1198 Titre : Towards an auction-driven gas supply : a simulation-based optimization framework for utilities Type de document : texte imprimé Auteurs : F. J. Otamendi, Auteur ; L. M. Doncel, Auteur Année de publication : 2012 Article en page(s) : pp. 1189–1198 Note générale : Operational research Langues : Anglais (eng) Mots-clés : Decision  analysis  Logistics  Gas  Simulation Index. décimale : 001.424 Résumé : A platform for the study of the whole transmission problem (arrival of ships, regasification, transportation and distribution) faced by gas utilities companies is proposed. The main objective of this research is to develop a platform that includes the analysis of the new capacity auctions (and not the traditional commodity auctions) that will govern the supply chain in the near future. A simulation-optimization approach has been used to favour the more realistic abstraction of the system. The discrete-event model includes a genetic algorithm to reach the solution in a satisfactory short time, a requisite in auction markets. Design and optimization studies for the utilities are addressed using the platform, which has been validated with real data for one of the main zones in the Spanish market. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011128a.html [article] Towards an auction-driven gas supply : a simulation-based optimization framework for utilities [texte imprimé] / F. J. Otamendi, Auteur ; L. M. Doncel, Auteur . - 2012 . - pp. 1189–1198. Operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1189–1198 Mots-clés : Decision  analysis  Logistics  Gas  Simulation Index. décimale : 001.424 Résumé : A platform for the study of the whole transmission problem (arrival of ships, regasification, transportation and distribution) faced by gas utilities companies is proposed. The main objective of this research is to develop a platform that includes the analysis of the new capacity auctions (and not the traditional commodity auctions) that will govern the supply chain in the near future. A simulation-optimization approach has been used to favour the more realistic abstraction of the system. The discrete-event model includes a genetic algorithm to reach the solution in a satisfactory short time, a requisite in auction markets. Design and optimization studies for the utilities are addressed using the platform, which has been validated with real data for one of the main zones in the Spanish market. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011128a.html

Benchmarking mean-variance portfolios using a shortage function / Kerstens, K. in Journal of the operational research society (JORS), Vol. 63 N° 9 (Septembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1199–1212 Titre : Benchmarking mean-variance portfolios using a shortage function : the choice of direction vector affects rankings! Type de document : texte imprimé Auteurs : Kerstens, K., Auteur ; A. Mounir, Auteur ; I. Van de Woestyne, Auteur Année de publication : 2012 Article en page(s) : pp. 1199–1212 Note générale : Operational research Langues : Anglais (eng) Mots-clés : Shortage  function  Efficient  frontier  Mean-variance  efficiency Index. décimale : 001.424 Résumé : In addition to its use in data envelopment analysis models, the shortage function has been proposed as a tool to gauge performance in multi-moment portfolio models. An open issue is how the choice of direction vector affects the efficiency measurement, especially when some of the data can be negative and, from a practical point of view, whether and how the resulting league tables are affected. This paper illustrates empirically how the choice of direction vector affects the relative ranking of mean-variance portfolios. This result is relevant to all frontier-based applications, especially those where some of the data can be naturally negative. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011140a.html [article] Benchmarking mean-variance portfolios using a shortage function : the choice of direction vector affects rankings! [texte imprimé] / Kerstens, K., Auteur ; A. Mounir, Auteur ; I. Van de Woestyne, Auteur . - 2012 . - pp. 1199–1212. Operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1199–1212 Mots-clés : Shortage  function  Efficient  frontier  Mean-variance  efficiency Index. décimale : 001.424 Résumé : In addition to its use in data envelopment analysis models, the shortage function has been proposed as a tool to gauge performance in multi-moment portfolio models. An open issue is how the choice of direction vector affects the efficiency measurement, especially when some of the data can be negative and, from a practical point of view, whether and how the resulting league tables are affected. This paper illustrates empirically how the choice of direction vector affects the relative ranking of mean-variance portfolios. This result is relevant to all frontier-based applications, especially those where some of the data can be naturally negative. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011140a.html

A single-resource revenue management problem with random resource consumptions / W. Zhuang in Journal of the operational research society (JORS), Vol. 63 N° 9 (Septembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1213–1227 Titre : A single-resource revenue management problem with random resource consumptions Type de document : texte imprimé Auteurs : W. Zhuang, Auteur ; M. Gumus, Auteur ; D. Zhang, Auteur Année de publication : 2012 Article en page(s) : pp. 1213–1227 Note générale : Operational research Langues : Anglais (eng) Mots-clés : Revenue  management  Dynamic  programming  Transportation Index. décimale : 001.424 Résumé : We study a single-resource multi-class revenue management problem where the resource consumption for each class is random and only revealed at departure. The model is motivated by cargo revenue management problems in the airline and other shipping industries. We study how random resource consumption distribution affects the optimal expected profit and identify a preference acceptance order on classes. For a special case where the resource consumption for each class follows the same distribution, we fully characterize the optimal control policy. We then propose two easily computable heuristics: (i) a class-independent heuristic through parameter scaling, and (ii) a decomposition heuristic that decomposes the dynamic programming formulation into a collection of one-dimensional problems. We conduct extensive numerical experiments to investigate the performance of the two heuristics and compared them with several widely studied heuristic policies. Our results show that both heuristics work very well, with class-independent heuristic slightly better between the two. In particular, they consistently outperform heuristics that ignore demand and/or resource consumption uncertainty. Our results demonstrate the importance of considering random resource consumption as another problem dimension in revenue management applications. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011129a.html [article] A single-resource revenue management problem with random resource consumptions [texte imprimé] / W. Zhuang, Auteur ; M. Gumus, Auteur ; D. Zhang, Auteur . - 2012 . - pp. 1213–1227. Operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1213–1227 Mots-clés : Revenue  management  Dynamic  programming  Transportation Index. décimale : 001.424 Résumé : We study a single-resource multi-class revenue management problem where the resource consumption for each class is random and only revealed at departure. The model is motivated by cargo revenue management problems in the airline and other shipping industries. We study how random resource consumption distribution affects the optimal expected profit and identify a preference acceptance order on classes. For a special case where the resource consumption for each class follows the same distribution, we fully characterize the optimal control policy. We then propose two easily computable heuristics: (i) a class-independent heuristic through parameter scaling, and (ii) a decomposition heuristic that decomposes the dynamic programming formulation into a collection of one-dimensional problems. We conduct extensive numerical experiments to investigate the performance of the two heuristics and compared them with several widely studied heuristic policies. Our results show that both heuristics work very well, with class-independent heuristic slightly better between the two. In particular, they consistently outperform heuristics that ignore demand and/or resource consumption uncertainty. Our results demonstrate the importance of considering random resource consumption as another problem dimension in revenue management applications. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011129a.html

Operational research and critical systems thinking / W. Ulrich in Journal of the operational research society (JORS), Vol. 63 N° 9 (Septembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1228–1247 Titre : Operational research and critical systems thinking : an integrated perspective Part 1: OR as applied systems thinking Type de document : texte imprimé Auteurs : W. Ulrich, Auteur Année de publication : 2012 Article en page(s) : pp. 1228–1247 Note générale : Operational research Langues : Anglais (eng) Mots-clés : Practice  of  OR  Philosophy  of  OR  Methodology  Professional  OR  education  Systems Index. décimale : 001.424 Résumé : What does good OR practice mean, and what can critical systems thinking (CST) do for it? This two-part essay proposes new answers to both questions. It reaches out to the wider community of OR professionals and explains from their perspective what CST is all about and why it matters for good practice. Part 1 first reviews the idea and history of systems thinking in OR, as a basis for properly situating CST within OR. It then offers a comparative, non-partisan account of the two strands of CST, critical systems heuristics and total systems intervention, and identifies their combined potential in an ability to enhance the contextual sophistication of OR. The prevalent but inaccurate notion of the history of OR as a linear evolution from ‘hard’ to ‘soft’ and ‘critical’ systems thinking is replaced by an integrated perspective of OR as applied systems thinking. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011141a.html [article] Operational research and critical systems thinking : an integrated perspective Part 1: OR as applied systems thinking [texte imprimé] / W. Ulrich, Auteur . - 2012 . - pp. 1228–1247. Operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1228–1247 Mots-clés : Practice  of  OR  Philosophy  of  OR  Methodology  Professional  OR  education  Systems Index. décimale : 001.424 Résumé : What does good OR practice mean, and what can critical systems thinking (CST) do for it? This two-part essay proposes new answers to both questions. It reaches out to the wider community of OR professionals and explains from their perspective what CST is all about and why it matters for good practice. Part 1 first reviews the idea and history of systems thinking in OR, as a basis for properly situating CST within OR. It then offers a comparative, non-partisan account of the two strands of CST, critical systems heuristics and total systems intervention, and identifies their combined potential in an ability to enhance the contextual sophistication of OR. The prevalent but inaccurate notion of the history of OR as a linear evolution from ‘hard’ to ‘soft’ and ‘critical’ systems thinking is replaced by an integrated perspective of OR as applied systems thinking. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011141a.html

A heuristic approach to classifying labeled/unlabeled data sets / K. Y. Huang in Journal of the operational research society (JORS), Vol. 63 N° 9 (Septembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1248–1257 Titre : A heuristic approach to classifying labeled/unlabeled data sets Type de document : texte imprimé Auteurs : K. Y. Huang, Auteur Année de publication : 2012 Article en page(s) : pp. 1248–1257 Note générale : Operational research Langues : Anglais (eng) Mots-clés : Optimization  Decision  analysis  Variable  precision  rough  set  MVPRS-index  method  Classification Index. décimale : 001.424 Résumé : A classification method, which comprises Fuzzy C-Means method, a modified form of the Huang-index function and Variable Precision Rough Set (VPRS) theory, is proposed for classifying labeled/unlabeled data sets in this study. This proposed method, designated as the MVPRS-index method, is used to partition the values of per conditional attribute within the data set and to achieve both the optimal number of clusters and the optimal accuracy of VPRS classification. The validity of the proposed approach is confirmed by comparing the classification results obtained from the MVPRS-index method for UCI data sets and a typical stock market data set with those obtained from the supervised neural networks classification method. Overall, the results show that the MVPRS-index method could be applied to data sets not only with labeled information but also with unlabeled information, and therefore provides a more reliable basis for the extraction of decision-making rules of labeled/unlabeled datasets. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011103a.html [article] A heuristic approach to classifying labeled/unlabeled data sets [texte imprimé] / K. Y. Huang, Auteur . - 2012 . - pp. 1248–1257. Operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1248–1257 Mots-clés : Optimization  Decision  analysis  Variable  precision  rough  set  MVPRS-index  method  Classification Index. décimale : 001.424 Résumé : A classification method, which comprises Fuzzy C-Means method, a modified form of the Huang-index function and Variable Precision Rough Set (VPRS) theory, is proposed for classifying labeled/unlabeled data sets in this study. This proposed method, designated as the MVPRS-index method, is used to partition the values of per conditional attribute within the data set and to achieve both the optimal number of clusters and the optimal accuracy of VPRS classification. The validity of the proposed approach is confirmed by comparing the classification results obtained from the MVPRS-index method for UCI data sets and a typical stock market data set with those obtained from the supervised neural networks classification method. Overall, the results show that the MVPRS-index method could be applied to data sets not only with labeled information but also with unlabeled information, and therefore provides a more reliable basis for the extraction of decision-making rules of labeled/unlabeled datasets. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011103a.html

Order-lot pegging for minimizing total tardiness in semiconductor wafer fabrication process / J.-G. Kim in Journal of the operational research society (JORS), Vol. 63 N° 9 (Septembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1258–1270 Titre : Order-lot pegging for minimizing total tardiness in semiconductor wafer fabrication process Type de document : texte imprimé Auteurs : J.-G. Kim, Auteur ; S.-K. Lim, Auteur Année de publication : 2012 Article en page(s) : pp. 1258–1270 Note générale : Operational research Langues : Anglais (eng) Mots-clés : Order-lot  pegging  Search  heuristics  Semiconductor  wafer  fabrication Index. décimale : 001.424 Résumé : We consider a problem of order-lot pegging in semiconductor wafer fabrication process. In the problem, we determine an assignment of wafers in lots to orders and a plan for input release of wafers into a wafer fabrication facility with the objective of minimizing total tardiness of the orders over a finite time horizon. The problem is formulated as a mixed integer linear program and proved to be strongly NP-hard. We find properties for an optimal order-lot assignment of the problem and develop a pegging method based on the properties. Also, we prove that an optimal order-lot assignment can be obtained by finding an optimal order sequence of assigning wafers to orders when using the pegging method developed in this study. In addition, we suggest two search heuristic algorithms for finding the optimal order sequence of assigning wafers to orders. The test results on randomly generated problems show that the suggested algorithms work fairly well compared to the commercial optimization software package and solve industrial-sized problems in a reasonable amount of time. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011133a.html [article] Order-lot pegging for minimizing total tardiness in semiconductor wafer fabrication process [texte imprimé] / J.-G. Kim, Auteur ; S.-K. Lim, Auteur . - 2012 . - pp. 1258–1270. Operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1258–1270 Mots-clés : Order-lot  pegging  Search  heuristics  Semiconductor  wafer  fabrication Index. décimale : 001.424 Résumé : We consider a problem of order-lot pegging in semiconductor wafer fabrication process. In the problem, we determine an assignment of wafers in lots to orders and a plan for input release of wafers into a wafer fabrication facility with the objective of minimizing total tardiness of the orders over a finite time horizon. The problem is formulated as a mixed integer linear program and proved to be strongly NP-hard. We find properties for an optimal order-lot assignment of the problem and develop a pegging method based on the properties. Also, we prove that an optimal order-lot assignment can be obtained by finding an optimal order sequence of assigning wafers to orders when using the pegging method developed in this study. In addition, we suggest two search heuristic algorithms for finding the optimal order sequence of assigning wafers to orders. The test results on randomly generated problems show that the suggested algorithms work fairly well compared to the commercial optimization software package and solve industrial-sized problems in a reasonable amount of time. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011133a.html

Automatic aircraft cargo load planning / S. Limbourg in Journal of the operational research society (JORS), Vol. 63 N° 9 (Septembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1271–1283 Titre : Automatic aircraft cargo load planning Type de document : texte imprimé Auteurs : S. Limbourg, Auteur ; M. Schyns, Auteur ; G. Laporte, Auteur Année de publication : 2012 Article en page(s) : pp. 1271–1283 Note générale : Operational research Langues : Anglais (eng) Mots-clés : Mixed  integer  programming  Cargo  aircraft  Unit  load  devices  Weight  and  balance  Moment  of  inertia  Fuel  economy Index. décimale : 001.424 Résumé : The goal of this paper is the development of a new mixed integer linear program designed for optimally loading a set of containers and pallets into a compartmentalised cargo aircraft. It is based on real-world problems submitted by a professional partner. This model takes into account strict technical and safety constraints. In addition to the standard goal of optimally positioning the centre of gravity, we also propose a new approach based on the moment of inertia. This double goal implies an increase in aircraft efficiency and a decrease in fuel consumption. Cargo loading generally remains a manual, or at best a computer-assisted, and time-consuming task. A fully automatic software was developed to quickly compute optimal solutions. Experimental results show that our approach achieves better solutions than manual planning, within only a few seconds. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011134a.html [article] Automatic aircraft cargo load planning [texte imprimé] / S. Limbourg, Auteur ; M. Schyns, Auteur ; G. Laporte, Auteur . - 2012 . - pp. 1271–1283. Operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1271–1283 Mots-clés : Mixed  integer  programming  Cargo  aircraft  Unit  load  devices  Weight  and  balance  Moment  of  inertia  Fuel  economy Index. décimale : 001.424 Résumé : The goal of this paper is the development of a new mixed integer linear program designed for optimally loading a set of containers and pallets into a compartmentalised cargo aircraft. It is based on real-world problems submitted by a professional partner. This model takes into account strict technical and safety constraints. In addition to the standard goal of optimally positioning the centre of gravity, we also propose a new approach based on the moment of inertia. This double goal implies an increase in aircraft efficiency and a decrease in fuel consumption. Cargo loading generally remains a manual, or at best a computer-assisted, and time-consuming task. A fully automatic software was developed to quickly compute optimal solutions. Experimental results show that our approach achieves better solutions than manual planning, within only a few seconds. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011134a.html

Minmax scheduling problems with common flow-allowance / B. Mor in Journal of the operational research society (JORS), Vol. 63 N° 9 (Septembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1284–1293 Titre : Minmax scheduling problems with common flow-allowance Type de document : texte imprimé Auteurs : B. Mor, Auteur ; Mosheiov, G., Auteur Année de publication : 2012 Article en page(s) : pp. 1284–1293 Note générale : Operational research Langues : Anglais (eng) Mots-clés : Scheduling  Due-date  assignment  Flow-allowance  Minmax Index. décimale : 001.424 Résumé : In due-date assignment problems with a common flow-allowance, the due-date of a given job is defined as the sum of its processing time and a job-independent constant. We study flow-allowance on a single machine, with an objective function of a minmax type. The total cost of a given job consists of its earliness/tardiness and its flow-allowance cost components. Thus, we seek the job schedule and flow-allowance value that minimize the largest cost among all the jobs. Three extensions are considered: the case of general position-dependent processing times, the model containing an explicit cost for the due-dates, and the setting of due-windows. Properties of optimal schedules are fully analysed in all cases, and all the problems are shown to have polynomial time solutions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011135a.html [article] Minmax scheduling problems with common flow-allowance [texte imprimé] / B. Mor, Auteur ; Mosheiov, G., Auteur . - 2012 . - pp. 1284–1293. Operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1284–1293 Mots-clés : Scheduling  Due-date  assignment  Flow-allowance  Minmax Index. décimale : 001.424 Résumé : In due-date assignment problems with a common flow-allowance, the due-date of a given job is defined as the sum of its processing time and a job-independent constant. We study flow-allowance on a single machine, with an objective function of a minmax type. The total cost of a given job consists of its earliness/tardiness and its flow-allowance cost components. Thus, we seek the job schedule and flow-allowance value that minimize the largest cost among all the jobs. Three extensions are considered: the case of general position-dependent processing times, the model containing an explicit cost for the due-dates, and the setting of due-windows. Properties of optimal schedules are fully analysed in all cases, and all the problems are shown to have polynomial time solutions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011135a.html

Robust vehicle routing problem with deadlines and travel time/demand uncertainty / C. Lee in Journal of the operational research society (JORS), Vol. 63 N° 9 (Septembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1294–1306 Titre : Robust vehicle routing problem with deadlines and travel time/demand uncertainty Type de document : texte imprimé Auteurs : C. Lee, Auteur ; K. Lee, Auteur ; S. Park, Auteur Année de publication : 2012 Article en page(s) : pp. 1294–1306 Note générale : Operational research Langues : Anglais (eng) Mots-clés : Vehicle  routing  Robust  optimization  Column  generation Index. décimale : 001.424 Résumé : In this article, we investigate the vehicle routing problem with deadlines, whose goal is to satisfy the requirements of a given number of customers with minimum travel distances while respecting both of the deadlines of the customers and vehicle capacity. It is assumed that the travel time between any two customers and the demands of the customer are uncertain. Two types of uncertainty sets with adjustable parameters are considered for the possible realizations of travel time and demand. The robustness of a solution against the uncertain data can be achieved by making the solution feasible for any travel time and demand defined in the uncertainty sets. We propose a Dantzig-Wolfe decomposition approach, which enables the uncertainty of the data to be encapsulated in the column generation subproblem. A dynamic programming algorithm is proposed to solve the subproblem with data uncertainty. The results of computational experiments involving two well-known test problems show that the robustness of the solution can be greatly improved. Note de contenu : In an earlier version of this article S Park's affiliation was wrongly given as ETRI. The correct affiliation, KAIST, is shown in this final version of the article. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011136a.html [article] Robust vehicle routing problem with deadlines and travel time/demand uncertainty [texte imprimé] / C. Lee, Auteur ; K. Lee, Auteur ; S. Park, Auteur . - 2012 . - pp. 1294–1306. Operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1294–1306 Mots-clés : Vehicle  routing  Robust  optimization  Column  generation Index. décimale : 001.424 Résumé : In this article, we investigate the vehicle routing problem with deadlines, whose goal is to satisfy the requirements of a given number of customers with minimum travel distances while respecting both of the deadlines of the customers and vehicle capacity. It is assumed that the travel time between any two customers and the demands of the customer are uncertain. Two types of uncertainty sets with adjustable parameters are considered for the possible realizations of travel time and demand. The robustness of a solution against the uncertain data can be achieved by making the solution feasible for any travel time and demand defined in the uncertainty sets. We propose a Dantzig-Wolfe decomposition approach, which enables the uncertainty of the data to be encapsulated in the column generation subproblem. A dynamic programming algorithm is proposed to solve the subproblem with data uncertainty. The results of computational experiments involving two well-known test problems show that the robustness of the solution can be greatly improved. Note de contenu : In an earlier version of this article S Park's affiliation was wrongly given as ETRI. The correct affiliation, KAIST, is shown in this final version of the article. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011136a.html

Operational research and critical systems thinking / W. Ulrich in Journal of the operational research society (JORS), Vol. 63 N° 9 (Septembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1307–1322 Titre : Operational research and critical systems thinking : an integrated perspective Part 2: OR as argumentative practice Type de document : texte imprimé Auteurs : W. Ulrich, Auteur Année de publication : 2012 Article en page(s) : pp. 1307–1322 Note générale : Operational research Langues : Anglais (eng) Mots-clés : Practice  of  OR  Philosophy  of  OR  Methodology  Professional  OR  educatio  Systems Index. décimale : 001.424 Résumé : On the basis of a review of the role of systems thinking in the history of OR, Part 1 of this essay proposed a systematic understanding of OR as applied systems thinking. Further, it identified the contribution of ‘critical’ systems thinking (CST) in a combined ability of its two strands, critical systems heuristics (CSH) and total systems intervention (TSI), to enhance the conceptual sophistication of OR. Part 2 aims to translate this understanding into a framework for good professional practice. How exactly can CST strengthen the competence profile of OR professionals? Drawing on three experience-based archetypes of professional service and some basic argumentation-theoretical considerations, a new understanding of OR and applied systems thinking as argumentative practice emerges. In this new understanding CST finds a systematic place and some exemplary uses of CSH and TSI can be located—an integrated perspective. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011145a.html [article] Operational research and critical systems thinking : an integrated perspective Part 2: OR as argumentative practice [texte imprimé] / W. Ulrich, Auteur . - 2012 . - pp. 1307–1322. Operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1307–1322 Mots-clés : Practice  of  OR  Philosophy  of  OR  Methodology  Professional  OR  educatio  Systems Index. décimale : 001.424 Résumé : On the basis of a review of the role of systems thinking in the history of OR, Part 1 of this essay proposed a systematic understanding of OR as applied systems thinking. Further, it identified the contribution of ‘critical’ systems thinking (CST) in a combined ability of its two strands, critical systems heuristics (CSH) and total systems intervention (TSI), to enhance the conceptual sophistication of OR. Part 2 aims to translate this understanding into a framework for good professional practice. How exactly can CST strengthen the competence profile of OR professionals? Drawing on three experience-based archetypes of professional service and some basic argumentation-theoretical considerations, a new understanding of OR and applied systems thinking as argumentative practice emerges. In this new understanding CST finds a systematic place and some exemplary uses of CSH and TSI can be located—an integrated perspective. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011145a.html

Exemplaires

Bibliothèque Ecole Nationale Polytechnique d'Alger

Accueil

Se connecter

Météo

Adresse