Dépouillements

Acting with systems intelligence: integrating complex responsive processes with the systems perspective / Luoma, J in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 3–11 Titre : Acting with systems intelligence: integrating complex responsive processes with the systems perspective Type de document : texte imprimé Auteurs : Luoma, J, Auteur ; Hämäläinen, R P, Auteur ; Saarinen, E., Auteur Année de publication : 2011 Article en page(s) : pp. 3–11 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Systems  thinking  Complex  responsive  processes  Systems  intelligence  Management  Practice  of  or  Philosophy  of  or Index. décimale : 001.424 Résumé : The systems thinking literature assumes that the concept of a system is useful in management and organizational research. Ralph D. Stacey and his collaborators, however, have questioned this. They have presented the theory of complex responsive processes (CRP) as an alternative to systems thinking. We argue that systems thinking and the CRP perspective are complementary. The CRP illuminates many of the micro-behavioural, local interaction and creativity-related organizational phenomena whereas the systems perspective is useful for other purposes. CRP misses the mark in its criticism of systems thinking. The insights of CRP should and could be incorporated, not switched, with the systems perspective. The systems intelligence perspective, proposed by Hämäläinen and Saarinen, provides a framework to accomplish that. By integrating systems thinking and the CRP model we hope to provide a platform from which it is possible to appreciate the relative merits of the two apparently conflicting strands of thought. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009175a.html [article] Acting with systems intelligence: integrating complex responsive processes with the systems perspective [texte imprimé] / Luoma, J, Auteur ; Hämäläinen, R P, Auteur ; Saarinen, E., Auteur . - 2011 . - pp. 3–11. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 3–11 Mots-clés : Systems  thinking  Complex  responsive  processes  Systems  intelligence  Management  Practice  of  or  Philosophy  of  or Index. décimale : 001.424 Résumé : The systems thinking literature assumes that the concept of a system is useful in management and organizational research. Ralph D. Stacey and his collaborators, however, have questioned this. They have presented the theory of complex responsive processes (CRP) as an alternative to systems thinking. We argue that systems thinking and the CRP perspective are complementary. The CRP illuminates many of the micro-behavioural, local interaction and creativity-related organizational phenomena whereas the systems perspective is useful for other purposes. CRP misses the mark in its criticism of systems thinking. The insights of CRP should and could be incorporated, not switched, with the systems perspective. The systems intelligence perspective, proposed by Hämäläinen and Saarinen, provides a framework to accomplish that. By integrating systems thinking and the CRP model we hope to provide a platform from which it is possible to appreciate the relative merits of the two apparently conflicting strands of thought. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009175a.html

An agent-based simulation approach for the new product diffusion of a novel biomass fuel / Günther, M in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 12–20 Titre : An agent-based simulation approach for the new product diffusion of a novel biomass fuel Type de document : texte imprimé Auteurs : Günther, M, Auteur ; Stummer, C, Auteur ; Wakolbinger, L. M., Auteur Année de publication : 2011 Article en page(s) : pp. 12–20 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Agent-based  simulation  Diffusion  of  innovation  Marketing  Biomass  fuel Index. décimale : 001.424 Résumé : Marketing activities support the market introduction of innovative goods or services by furthering their diffusion and, thus, their success. However, such activities are rather expensive. Managers must therefore decide which specific marketing activities to apply to which extent and/or to which target group at which point in time. In this paper, we introduce an agent-based simulation approach that supports decision-makers in these concerns. The practical applicability of our tool is illustrated by means of a case study of a novel, biomass-based fuel that will likely be introduced on the Austrian market within the next 5 years. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009170a.html [article] An agent-based simulation approach for the new product diffusion of a novel biomass fuel [texte imprimé] / Günther, M, Auteur ; Stummer, C, Auteur ; Wakolbinger, L. M., Auteur . - 2011 . - pp. 12–20. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 12–20 Mots-clés : Agent-based  simulation  Diffusion  of  innovation  Marketing  Biomass  fuel Index. décimale : 001.424 Résumé : Marketing activities support the market introduction of innovative goods or services by furthering their diffusion and, thus, their success. However, such activities are rather expensive. Managers must therefore decide which specific marketing activities to apply to which extent and/or to which target group at which point in time. In this paper, we introduce an agent-based simulation approach that supports decision-makers in these concerns. The practical applicability of our tool is illustrated by means of a case study of a novel, biomass-based fuel that will likely be introduced on the Austrian market within the next 5 years. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009170a.html

Implementation processes / Martin, C. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 21–28 Titre : Implementation processes : a Boolean analysis Type de document : texte imprimé Auteurs : Martin, C., Auteur ; Metcalfe, M., Auteur Année de publication : 2011 Article en page(s) : pp. 21–28 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Implementation  Organisational  change  processes  Boolean  analysis Index. décimale : 001.424 Résumé : Implementing new operating procedures into organisations is problematic. It requires consideration of the socialisation processes needed to encourage implementers to creatively adopt and adapt the new procedure. The four main explanations of why organisational change occurs are teleology (group emerged action), evolution, dialectic and life cycles (growth stages). These have been mapped onto the corresponding organisational socialisation processes of job rotation, benchmarking with continuous improvement, competition and the use of champions. It has been claimed that successful implementation requires a mix of all four of these processes. This paper tests that claim by comparing the implementation of Total Quality Management into 32 independent and geographically dispersed bulk grain handling sites located around South Australia. Using Boolean Analysis it was found that successful implementation was achieved using either (a) self managed problem-solving teams and a review teams or, (b) champions with job rotation and site visits. Both of these mixes of socialisation processes worked; doing both was not necessary. The implications of this finding are discussed. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009172a.html [article] Implementation processes : a Boolean analysis [texte imprimé] / Martin, C., Auteur ; Metcalfe, M., Auteur . - 2011 . - pp. 21–28. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 21–28 Mots-clés : Implementation  Organisational  change  processes  Boolean  analysis Index. décimale : 001.424 Résumé : Implementing new operating procedures into organisations is problematic. It requires consideration of the socialisation processes needed to encourage implementers to creatively adopt and adapt the new procedure. The four main explanations of why organisational change occurs are teleology (group emerged action), evolution, dialectic and life cycles (growth stages). These have been mapped onto the corresponding organisational socialisation processes of job rotation, benchmarking with continuous improvement, competition and the use of champions. It has been claimed that successful implementation requires a mix of all four of these processes. This paper tests that claim by comparing the implementation of Total Quality Management into 32 independent and geographically dispersed bulk grain handling sites located around South Australia. Using Boolean Analysis it was found that successful implementation was achieved using either (a) self managed problem-solving teams and a review teams or, (b) champions with job rotation and site visits. Both of these mixes of socialisation processes worked; doing both was not necessary. The implications of this finding are discussed. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009172a.html

Kalman filtering as a performance monitoring technique for a propensity scorecard / Bijak, K. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 29–37 Titre : Kalman filtering as a performance monitoring technique for a propensity scorecard Type de document : texte imprimé Auteurs : Bijak, K., Auteur Année de publication : 2011 Article en page(s) : pp. 29–37 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Propensity  scorecard  Scorecard  monitoring  Kalman  filtering  Bootstrap Index. décimale : 001.424 Résumé : Propensity scorecards allow forecasting, which bank customers would like to be granted new credits in the near future, through assessing their willingness to apply for new loans. Kalman filtering can help to monitor scorecard performance. Data from successive months are used to update the baseline model. The updated scorecard is the output of the Kalman filter. There is no assumption concerning the scoring model specification and no specific estimation method is presupposed. Thus, the estimator covariance is derived from the bootstrap. The focus is on a relationship between the score and the natural logarithm of the odds for that score, which is used to determine a customer's propensity level. The propensity levels corresponding to the baseline and updated scores are compared. That comparison allows for monitoring whether the scorecard is still up-to-date in terms of assigning the odds. The presented technique is illustrated with an example of a propensity scorecard developed on the basis of credit bureau data. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009183a.html [article] Kalman filtering as a performance monitoring technique for a propensity scorecard [texte imprimé] / Bijak, K., Auteur . - 2011 . - pp. 29–37. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 29–37 Mots-clés : Propensity  scorecard  Scorecard  monitoring  Kalman  filtering  Bootstrap Index. décimale : 001.424 Résumé : Propensity scorecards allow forecasting, which bank customers would like to be granted new credits in the near future, through assessing their willingness to apply for new loans. Kalman filtering can help to monitor scorecard performance. Data from successive months are used to update the baseline model. The updated scorecard is the output of the Kalman filter. There is no assumption concerning the scoring model specification and no specific estimation method is presupposed. Thus, the estimator covariance is derived from the bootstrap. The focus is on a relationship between the score and the natural logarithm of the odds for that score, which is used to determine a customer's propensity level. The propensity levels corresponding to the baseline and updated scores are compared. That comparison allows for monitoring whether the scorecard is still up-to-date in terms of assigning the odds. The presented technique is illustrated with an example of a propensity scorecard developed on the basis of credit bureau data. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009183a.html

Space allocation and aisle positioning for an industrial pick-to-belt system / Anken, N. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 38–49 Titre : Space allocation and aisle positioning for an industrial pick-to-belt system Type de document : texte imprimé Auteurs : Anken, N., Auteur ; Gagliard, J.-P., Auteur ; Renaud, J., Auteur Année de publication : 2011 Article en page(s) : pp. 38–49 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Product  location  Heuristics  Distribution  Warehousing Index. décimale : 001.424 Résumé : Distribution centres (DCs) are a key component in supply chains. In order to respond quickly to customer demands, most DCs use a fast-pick area where order picking can be executed efficiently. In these areas, the amount of space allocated to each product is of great importance, as it determines the number of replenishments required to guarantee product availability, thus avoiding interruptions in the order picking. The obvious assumption is that the performance of DCs could be improved by using simple strategies such as assigning more space to products having the highest demand. However, as this paper shows, the practical constraints related to the need for aisles granting safe and easy access to storage locations make designing fast-pick areas difficult. A parameter-free, two-phase algorithm based on product-adding heuristics combined with a space-reduction heuristic is proposed to solve this design problem. When applied to real data provided by our industrial partner, this heuristic generated considerable time savings. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009180a.html [article] Space allocation and aisle positioning for an industrial pick-to-belt system [texte imprimé] / Anken, N., Auteur ; Gagliard, J.-P., Auteur ; Renaud, J., Auteur . - 2011 . - pp. 38–49. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 38–49 Mots-clés : Product  location  Heuristics  Distribution  Warehousing Index. décimale : 001.424 Résumé : Distribution centres (DCs) are a key component in supply chains. In order to respond quickly to customer demands, most DCs use a fast-pick area where order picking can be executed efficiently. In these areas, the amount of space allocated to each product is of great importance, as it determines the number of replenishments required to guarantee product availability, thus avoiding interruptions in the order picking. The obvious assumption is that the performance of DCs could be improved by using simple strategies such as assigning more space to products having the highest demand. However, as this paper shows, the practical constraints related to the need for aisles granting safe and easy access to storage locations make designing fast-pick areas difficult. A parameter-free, two-phase algorithm based on product-adding heuristics combined with a space-reduction heuristic is proposed to solve this design problem. When applied to real data provided by our industrial partner, this heuristic generated considerable time savings. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009180a.html

Decision conferencing for science prioritisation in the UK public sector: / Morton, A. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 50–59 Titre : Decision conferencing for science prioritisation in the UK public sector: : a dual case study Type de document : texte imprimé Auteurs : Morton, A., Auteur ; Bird, D., Auteur ; Jones, A., Auteur Année de publication : 2011 Article en page(s) : pp. 50–59 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Science  prioritisation  Decision  conferencing  Decision  analysis Index. décimale : 001.424 Résumé : Decision Conferencing, a decision analytic approach, was introduced for science project prioritisation in two organisations of the UK public sector: the National Measurement System Programmes, Unit of the Department of Trade and Industry (now part of the National Measurement Office, an Executive Agency of the Department for Business, Innovation and Skills) and the Science Department of the Environment Agency of England and Wales. Despite some similarities between the organisations, they responded in quite different ways. We describe the organisational contexts in the two organisations, the process by which Decision Conferencing was introduced, and explore possible reasons for the differing experiences. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009184a.html [article] Decision conferencing for science prioritisation in the UK public sector: : a dual case study [texte imprimé] / Morton, A., Auteur ; Bird, D., Auteur ; Jones, A., Auteur . - 2011 . - pp. 50–59. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 50–59 Mots-clés : Science  prioritisation  Decision  conferencing  Decision  analysis Index. décimale : 001.424 Résumé : Decision Conferencing, a decision analytic approach, was introduced for science project prioritisation in two organisations of the UK public sector: the National Measurement System Programmes, Unit of the Department of Trade and Industry (now part of the National Measurement Office, an Executive Agency of the Department for Business, Innovation and Skills) and the Science Department of the Environment Agency of England and Wales. Despite some similarities between the organisations, they responded in quite different ways. We describe the organisational contexts in the two organisations, the process by which Decision Conferencing was introduced, and explore possible reasons for the differing experiences. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009184a.html

Incorporating geo-metallurgical information into mine production scheduling / Kumral, M. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 60–68 Titre : Incorporating geo-metallurgical information into mine production scheduling Type de document : texte imprimé Auteurs : Kumral, M., Auteur Année de publication : 2011 Article en page(s) : pp. 60–68 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Geo-metallurgical  variables  Uncertainty  Stochastic  programming  with  recourse  Mine  production  scheduling  Maximin  problem Index. décimale : 001.424 Résumé : Economic characterization of mining parcels depends upon geo-metallurgical properties, which vary throughout orebody. Mine production scheduling should aim to obtain maximum utility from orebody in such a way as to ensure mine–mill reconciliation. As heterogeneity of geo-metallurgical variables increases, the scheduling will be a very complicated task. Geo-metallurgical and financial data used in the mine production scheduling are based on simulation and/or estimation generated from sparse drilling and unknown future events. Therefore, the scheduling process involves a significant degree of uncertainty. In order to deal with the uncertainty stemmed from geo-metallurgical and financial variables, two approaches are recommended in this paper. Firstly, mine production scheduling is formulated as a problem of stochastic programming with recourse. The extraction periods of mining blocks are treated as the first-stage variables and the block destinations represents a recourse vector. It is observed that the solution is implicitly robust. Secondly, the scheduling is expressed as a maximin problem to extract more uniform metal quantity in periods to coincide with mill requirements instead of maximization of net present value because the blending constraint in the traditional approach forces more uniform production. In the case where there is correlation between grade and geo-metallurgical variables, this model generates reasonably good results. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009174a.html [article] Incorporating geo-metallurgical information into mine production scheduling [texte imprimé] / Kumral, M., Auteur . - 2011 . - pp. 60–68. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 60–68 Mots-clés : Geo-metallurgical  variables  Uncertainty  Stochastic  programming  with  recourse  Mine  production  scheduling  Maximin  problem Index. décimale : 001.424 Résumé : Economic characterization of mining parcels depends upon geo-metallurgical properties, which vary throughout orebody. Mine production scheduling should aim to obtain maximum utility from orebody in such a way as to ensure mine–mill reconciliation. As heterogeneity of geo-metallurgical variables increases, the scheduling will be a very complicated task. Geo-metallurgical and financial data used in the mine production scheduling are based on simulation and/or estimation generated from sparse drilling and unknown future events. Therefore, the scheduling process involves a significant degree of uncertainty. In order to deal with the uncertainty stemmed from geo-metallurgical and financial variables, two approaches are recommended in this paper. Firstly, mine production scheduling is formulated as a problem of stochastic programming with recourse. The extraction periods of mining blocks are treated as the first-stage variables and the block destinations represents a recourse vector. It is observed that the solution is implicitly robust. Secondly, the scheduling is expressed as a maximin problem to extract more uniform metal quantity in periods to coincide with mill requirements instead of maximization of net present value because the blending constraint in the traditional approach forces more uniform production. In the case where there is correlation between grade and geo-metallurgical variables, this model generates reasonably good results. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009174a.html

Stochastic flow shop scheduling model for the panama canal / Jackman, J. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 69–80 Titre : Stochastic flow shop scheduling model for the panama canal Type de document : texte imprimé Auteurs : Jackman, J., Auteur ; de Castillo, Z. Guerra, Auteur ; Olafsson, S., Auteur Année de publication : 2011 Article en page(s) : pp. 69–80 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Simulation  Metaheuristics Index. décimale : 001.424 Résumé : Reducing transit time is becoming increasingly important in maritime shipping of manufactured goods and commodities. Traversing the Panama Canal is a principal component of many global companies’ strategies to reduce shipping time in their supply chain. Operations in the Panama Canal can be described by a capacitated queueing network. In this study we used a metaheuristic approach based on Nested Partitions to find near optimal schedules for daily vessel traffic consisting of large vessels that want to pass through the Panama Canal. Results indicate that the metaheuristic technique consistently reduced the makespan of a set of vessels as compared to historical schedules used in canal operations. We also found distinct patterns in the schedules in which certain vessels consistently appeared at a certain position in the schedule. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009188a.html [article] Stochastic flow shop scheduling model for the panama canal [texte imprimé] / Jackman, J., Auteur ; de Castillo, Z. Guerra, Auteur ; Olafsson, S., Auteur . - 2011 . - pp. 69–80. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 69–80 Mots-clés : Scheduling  Simulation  Metaheuristics Index. décimale : 001.424 Résumé : Reducing transit time is becoming increasingly important in maritime shipping of manufactured goods and commodities. Traversing the Panama Canal is a principal component of many global companies’ strategies to reduce shipping time in their supply chain. Operations in the Panama Canal can be described by a capacitated queueing network. In this study we used a metaheuristic approach based on Nested Partitions to find near optimal schedules for daily vessel traffic consisting of large vessels that want to pass through the Panama Canal. Results indicate that the metaheuristic technique consistently reduced the makespan of a set of vessels as compared to historical schedules used in canal operations. We also found distinct patterns in the schedules in which certain vessels consistently appeared at a certain position in the schedule. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009188a.html

A negotiated solution for the Jordan basin / Atwi, M. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 81–91 Titre : A negotiated solution for the Jordan basin Type de document : texte imprimé Auteurs : Atwi, M., Auteur ; Chóliz, J. S., Auteur Année de publication : 2011 Article en page(s) : pp. 81–91 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Jordan  basin  Water  allocation  Water  conflict  Negotiation  game Index. décimale : 001.424 Résumé : The use of water in the Jordan Basin has been a key factor in the conflict between Israel and the Palestinians, and among Israel and its neighbours. In this paper, we explore possible ways of sharing water through a negotiation game with two players—Arabs and Israelis. We estimate a set of optimum Pareto allocations, as well as identifying a range of negotiated solutions. Our results suggest that viable solutions would improve incomes by some 20% compared to the current status quo. These solutions are close to the long-standing proposal contained in the Johnston Plan. Meanwhile, theoretical fairness criteria, which are more favourable to the Arabs than the Johnston Plan, maybe are not actually better in technical terms and could in any case only be achieved if the Arabs’ negotiating position were much stronger than the Israelis’. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009162a.html [article] A negotiated solution for the Jordan basin [texte imprimé] / Atwi, M., Auteur ; Chóliz, J. S., Auteur . - 2011 . - pp. 81–91. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 81–91 Mots-clés : Jordan  basin  Water  allocation  Water  conflict  Negotiation  game Index. décimale : 001.424 Résumé : The use of water in the Jordan Basin has been a key factor in the conflict between Israel and the Palestinians, and among Israel and its neighbours. In this paper, we explore possible ways of sharing water through a negotiation game with two players—Arabs and Israelis. We estimate a set of optimum Pareto allocations, as well as identifying a range of negotiated solutions. Our results suggest that viable solutions would improve incomes by some 20% compared to the current status quo. These solutions are close to the long-standing proposal contained in the Johnston Plan. Meanwhile, theoretical fairness criteria, which are more favourable to the Arabs than the Johnston Plan, maybe are not actually better in technical terms and could in any case only be achieved if the Arabs’ negotiating position were much stronger than the Israelis’. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009162a.html

A hybrid genetic algorithmic approach to the maximally diverse grouping problem / Fan, Z. P. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 92–99 Titre : A hybrid genetic algorithmic approach to the maximally diverse grouping problem Type de document : texte imprimé Auteurs : Fan, Z. P., Auteur ; Y. Chen, Auteur ; Ma, J., Auteur Année de publication : 2011 Article en page(s) : pp. 92–99 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Genetic  algorithm  Maximally  diverse  grouping  problem  Local  neighbourhood  search Index. décimale : 001.424 Résumé : The maximally diverse grouping problem (MDGP) is a NP-complete problem. For such NP-complete problems, heuristics play a major role in searching for solutions. Most of the heuristics for MDGP focus on the equal group-size situation. In this paper, we develop a genetic algorithm (GA)-based hybrid heuristic to solve this problem considering not only the equal group-size situation but also the different group-size situation. The performance of the algorithm is compared with the established Lotfi–Cerveny–Weitz algorithm and the non-hybrid GA. Computational experience indicates that the proposed GA-based hybrid algorithm is a good tool for solving MDGP. Moreover, it can be easily modified to solve other equivalent problems. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009168a.html [article] A hybrid genetic algorithmic approach to the maximally diverse grouping problem [texte imprimé] / Fan, Z. P., Auteur ; Y. Chen, Auteur ; Ma, J., Auteur . - 2011 . - pp. 92–99. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 92–99 Mots-clés : Genetic  algorithm  Maximally  diverse  grouping  problem  Local  neighbourhood  search Index. décimale : 001.424 Résumé : The maximally diverse grouping problem (MDGP) is a NP-complete problem. For such NP-complete problems, heuristics play a major role in searching for solutions. Most of the heuristics for MDGP focus on the equal group-size situation. In this paper, we develop a genetic algorithm (GA)-based hybrid heuristic to solve this problem considering not only the equal group-size situation but also the different group-size situation. The performance of the algorithm is compared with the established Lotfi–Cerveny–Weitz algorithm and the non-hybrid GA. Computational experience indicates that the proposed GA-based hybrid algorithm is a good tool for solving MDGP. Moreover, it can be easily modified to solve other equivalent problems. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009168a.html

A cover-based competitive location model / Drezner, T. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 100–113 Titre : A cover-based competitive location model Type de document : texte imprimé Auteurs : Drezner, T., Auteur ; Z. Drezner, Auteur ; Kalczynski, P., Auteur Année de publication : 2011 Article en page(s) : pp. 100–113 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Location  Competitive  Cover  Lost  demand Index. décimale : 001.424 Résumé : In this paper we propose a new approach to estimating market share captured by competing facilities. The approach is based on cover location models. Each competing facility has a ‘sphere of influence’ determined by its attractiveness level. More attractive facilities have a larger radius of the sphere of influence. The buying power of a customer within the sphere of influence of several facilities is equally divided among the competing facilities. The buying power of a customer within the sphere of influence of no facility is lost. Assuming the presence of competition in the area, the objective is to add a number of new facilities to a chain of existing facilities in such a way that the increase of market share captured by the chain is maximized. The model is formulated and analysed. Optimal and heuristic solution algorithms are designed. Computational experiments demonstrate the effectiveness of the proposed algorithms. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009153a.html [article] A cover-based competitive location model [texte imprimé] / Drezner, T., Auteur ; Z. Drezner, Auteur ; Kalczynski, P., Auteur . - 2011 . - pp. 100–113. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 100–113 Mots-clés : Location  Competitive  Cover  Lost  demand Index. décimale : 001.424 Résumé : In this paper we propose a new approach to estimating market share captured by competing facilities. The approach is based on cover location models. Each competing facility has a ‘sphere of influence’ determined by its attractiveness level. More attractive facilities have a larger radius of the sphere of influence. The buying power of a customer within the sphere of influence of several facilities is equally divided among the competing facilities. The buying power of a customer within the sphere of influence of no facility is lost. Assuming the presence of competition in the area, the objective is to add a number of new facilities to a chain of existing facilities in such a way that the increase of market share captured by the chain is maximized. The model is formulated and analysed. Optimal and heuristic solution algorithms are designed. Computational experiments demonstrate the effectiveness of the proposed algorithms. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009153a.html

Transforming part-sequencing problems in a robotic cell into a GTSP / Zahrouni, W. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 114–123 Titre : Transforming part-sequencing problems in a robotic cell into a GTSP Type de document : texte imprimé Auteurs : Zahrouni, W., Auteur ; Kamoun, H., Auteur Année de publication : 2011 Article en page(s) : pp. 114–123 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Sequencing  Heuristics  Flexible  manufacturing  systems Index. décimale : 001.424 Résumé : This paper shows how to solve two-part sequencing problems in a three-machine robotic cell so as to minimize the cycle time. We start dealing with cycles whose associated part-sequencing problems do not have the structure of a travelling salesman problem (TSP). The idea behind our approach is to modify the waiting time formula and formulate the closely related modified problem as a generalized travelling salesman problem (GTSP). The other cycles to be tackled are those that have a TSP structure for their associated part-sequencing problem. The existence of common states between these cycles allows us to mix and mould all of them into a GTSP. The solution procedures, designed for both cycle classes, are merged into a single heuristic and evaluated. The computational results provided prove the efficiency of the approaches. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009158a.html [article] Transforming part-sequencing problems in a robotic cell into a GTSP [texte imprimé] / Zahrouni, W., Auteur ; Kamoun, H., Auteur . - 2011 . - pp. 114–123. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 114–123 Mots-clés : Scheduling  Sequencing  Heuristics  Flexible  manufacturing  systems Index. décimale : 001.424 Résumé : This paper shows how to solve two-part sequencing problems in a three-machine robotic cell so as to minimize the cycle time. We start dealing with cycles whose associated part-sequencing problems do not have the structure of a travelling salesman problem (TSP). The idea behind our approach is to modify the waiting time formula and formulate the closely related modified problem as a generalized travelling salesman problem (GTSP). The other cycles to be tackled are those that have a TSP structure for their associated part-sequencing problem. The existence of common states between these cycles allows us to mix and mould all of them into a GTSP. The solution procedures, designed for both cycle classes, are merged into a single heuristic and evaluated. The computational results provided prove the efficiency of the approaches. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009158a.html

Maintenance models based on the np control charts with respect to the sampling interval / Wang, W. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 124–133 Titre : Maintenance models based on the np control charts with respect to the sampling interval Type de document : texte imprimé Auteurs : Wang, W., Auteur Année de publication : 2011 Article en page(s) : pp. 124–133 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Sampling  interval  Maintenance  schedule  Control  chart  Repairable  system  Geometric  processes Index. décimale : 001.424 Résumé : This paper develops models for the maintenance of a system based on np control charts with respect to the sampling interval. At any given time, the system is assumed to be in one of the three possible states; in-control, out-of-control and failure. If the control chart signals, suggesting the possibility of an out-of-control state, an investigation will be carried out. We assume that this investigation is perfect in that it reveals the true state of the system. If an assignable cause is confirmed by the investigation, a minor repair will be carried out to remove the cause. If the assignable cause is not attended to, it will gradually develop into a failure. When a failure occurs, the system cannot operate and a major repair is needed. We discuss three models depending on the assumptions related to the renewal mechanism, the occurrence of failures, and the time between minor repairs. The paper seeks to optimise the performance of such a system in terms of the sampling interval. Geometric processes are utilised for modelling the lifetimes between minor repairs if the minor repair cannot bring the system back to an as good as new condition. The expected cost per unit time for maintaining the systems with respect to the sampling interval of the control chart is obtained. Numerical examples are conducted to demonstrate the applicability of the methodology derived. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009165a.html [article] Maintenance models based on the np control charts with respect to the sampling interval [texte imprimé] / Wang, W., Auteur . - 2011 . - pp. 124–133. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 124–133 Mots-clés : Sampling  interval  Maintenance  schedule  Control  chart  Repairable  system  Geometric  processes Index. décimale : 001.424 Résumé : This paper develops models for the maintenance of a system based on np control charts with respect to the sampling interval. At any given time, the system is assumed to be in one of the three possible states; in-control, out-of-control and failure. If the control chart signals, suggesting the possibility of an out-of-control state, an investigation will be carried out. We assume that this investigation is perfect in that it reveals the true state of the system. If an assignable cause is confirmed by the investigation, a minor repair will be carried out to remove the cause. If the assignable cause is not attended to, it will gradually develop into a failure. When a failure occurs, the system cannot operate and a major repair is needed. We discuss three models depending on the assumptions related to the renewal mechanism, the occurrence of failures, and the time between minor repairs. The paper seeks to optimise the performance of such a system in terms of the sampling interval. Geometric processes are utilised for modelling the lifetimes between minor repairs if the minor repair cannot bring the system back to an as good as new condition. The expected cost per unit time for maintaining the systems with respect to the sampling interval of the control chart is obtained. Numerical examples are conducted to demonstrate the applicability of the methodology derived. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009165a.html

Optimal defence of single object with imperfect false targets / Peng, R. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 134–141 Titre : Optimal defence of single object with imperfect false targets Type de document : texte imprimé Auteurs : Peng, R., Auteur ; G. Levitin, Auteur ; Xie, M., Auteur Année de publication : 2011 Article en page(s) : pp. 134–141 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Vulnerability  Attack  Defence  False  target Index. décimale : 001.424 Résumé : The paper considers an object exposed to external intentional attacks. The defender distributes its resource between deploying false targets and protecting the object. The false targets are not perfect and there is a nonzero probability that a false target can be detected by the attacker. Once the attacker has detected a certain number of false targets, it ignores them and chooses such number of undetected targets to attack that maximizes the probability of the object destruction. The defender decides how many false targets to deploy in order to minimize the probability of the object destruction assuming that the attacker uses the most harmful strategy to attack. The optimal number of false targets and the optimal number of attacked targets are obtained for the case of single and multiple types of the false targets. A methodology of finding the optimal defence strategy under uncertain contest intensity is suggested. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009171a.html [article] Optimal defence of single object with imperfect false targets [texte imprimé] / Peng, R., Auteur ; G. Levitin, Auteur ; Xie, M., Auteur . - 2011 . - pp. 134–141. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 134–141 Mots-clés : Vulnerability  Attack  Defence  False  target Index. décimale : 001.424 Résumé : The paper considers an object exposed to external intentional attacks. The defender distributes its resource between deploying false targets and protecting the object. The false targets are not perfect and there is a nonzero probability that a false target can be detected by the attacker. Once the attacker has detected a certain number of false targets, it ignores them and chooses such number of undetected targets to attack that maximizes the probability of the object destruction. The defender decides how many false targets to deploy in order to minimize the probability of the object destruction assuming that the attacker uses the most harmful strategy to attack. The optimal number of false targets and the optimal number of attacked targets are obtained for the case of single and multiple types of the false targets. A methodology of finding the optimal defence strategy under uncertain contest intensity is suggested. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009171a.html

Sensor information monotonicity in disambiguation protocols / Ye, X. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 142–151 Titre : Sensor information monotonicity in disambiguation protocols Type de document : texte imprimé Auteurs : Ye, X., Auteur ; Fishkind, D. E., Auteur ; Abrams, L., Auteur Année de publication : 2011 Article en page(s) : pp. 142–151 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Probabilistic  path  planning  Dynamic  disambiguation Index. décimale : 001.424 Résumé : Previous work has considered the problem of swiftly traversing a marked traversal-medium where the marks represent probabilities that associated local regions are traversable, further supposing that the traverser is equipped with a dynamic capability to disambiguate these regions en route. In practice, however, the marks are given by a noisy sensor, and are only estimates of the respective probabilities of traversability. In this paper, we investigate the performance of disambiguation protocols that utilize such sensor readings. In particular, we investigate the difference in performance when a disambiguation protocol employs various sensors ranked by their estimation quality. We demonstrate that a superior sensor can yield superior traversal performance—so called Sensor Information Monotonicity. In so doing, we provide to the decision-maker the wherewithal to quantitatively assess the advantage of a superior (and presumably more expensive) sensor in light of the associated improvement in performance. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009152a.html [article] Sensor information monotonicity in disambiguation protocols [texte imprimé] / Ye, X., Auteur ; Fishkind, D. E., Auteur ; Abrams, L., Auteur . - 2011 . - pp. 142–151. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 142–151 Mots-clés : Probabilistic  path  planning  Dynamic  disambiguation Index. décimale : 001.424 Résumé : Previous work has considered the problem of swiftly traversing a marked traversal-medium where the marks represent probabilities that associated local regions are traversable, further supposing that the traverser is equipped with a dynamic capability to disambiguate these regions en route. In practice, however, the marks are given by a noisy sensor, and are only estimates of the respective probabilities of traversability. In this paper, we investigate the performance of disambiguation protocols that utilize such sensor readings. In particular, we investigate the difference in performance when a disambiguation protocol employs various sensors ranked by their estimation quality. We demonstrate that a superior sensor can yield superior traversal performance—so called Sensor Information Monotonicity. In so doing, we provide to the decision-maker the wherewithal to quantitatively assess the advantage of a superior (and presumably more expensive) sensor in light of the associated improvement in performance. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009152a.html

Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria / Ozlen, M. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 152-164 Titre : Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria Type de document : texte imprimé Auteurs : Ozlen, M., Auteur ; Azizoglu, M., Auteur Année de publication : 2011 Article en page(s) : pp. 152-164 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Rescheduling  Unrelated  parallel  machines  Efficient  schedules Index. décimale : 001.424 Résumé : In this paper, we consider a rescheduling problem where a set of jobs has already been assigned to unrelated parallel machines. When a disruption occurs on one of the machines, the affected jobs are rescheduled, considering the efficiency and the schedule deviation measures. The efficiency measure is the total flow time, and the schedule deviation measure is the total disruption cost caused by the differences between the initial and current schedules. We provide polynomial-time solution methods to the following hierarchical optimization problems: minimizing total disruption cost among the minimum total flow time schedules and minimizing total flow time among the minimum total disruption cost schedules. We propose exponential-time algorithms to generate all efficient solutions and to minimize a specified function of the measures. Our extensive computational tests on large size problem instances have revealed that our optimization algorithm finds the best solution by generating only a small portion of all efficient solutions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009157a.html [article] Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria [texte imprimé] / Ozlen, M., Auteur ; Azizoglu, M., Auteur . - 2011 . - pp. 152-164. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 152-164 Mots-clés : Rescheduling  Unrelated  parallel  machines  Efficient  schedules Index. décimale : 001.424 Résumé : In this paper, we consider a rescheduling problem where a set of jobs has already been assigned to unrelated parallel machines. When a disruption occurs on one of the machines, the affected jobs are rescheduled, considering the efficiency and the schedule deviation measures. The efficiency measure is the total flow time, and the schedule deviation measure is the total disruption cost caused by the differences between the initial and current schedules. We provide polynomial-time solution methods to the following hierarchical optimization problems: minimizing total disruption cost among the minimum total flow time schedules and minimizing total flow time among the minimum total disruption cost schedules. We propose exponential-time algorithms to generate all efficient solutions and to minimize a specified function of the measures. Our extensive computational tests on large size problem instances have revealed that our optimization algorithm finds the best solution by generating only a small portion of all efficient solutions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009157a.html

Meta-heuristic algorithms for wafer sorting scheduling problems / Lin, Shih-Wei in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 165–174 Titre : Meta-heuristic algorithms for wafer sorting scheduling problems Type de document : texte imprimé Auteurs : Lin, Shih-Wei, Auteur ; Lee, Zne-Jung, Auteur ; Ying, Kuo-Ching, Auteur Année de publication : 2011 Article en page(s) : pp. 165–174 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Wafer  sorting  scheduling  problem  Meta-heuristic  Parallel  machine  scheduling  problem Index. décimale : 001.424 Résumé : Wafer sorting is usually regarded as the most critical stage in the whole wafer probing process. This paper discusses the wafer sorting scheduling problem (WSSP) with total setup time minimization as the primary criterion and the minimization of the number of machines used as the secondary criterion. Although the need to consider multiple criteria in real-world WSSPs is widely recognized, the present study is the first attempt to investigate this argument with setups consideration. In view of the strongly NP-hard nature of this problem, three meta-heuristic algorithms—an ant colony system algorithm, a Genetic algorithm, and a Tabu search algorithm are proposed. The proposed meta-heuristics are empirically evaluated by 480 simulation instances based on the characteristics of a real wafer testing shop-floor and found to be very effective in terms of finding good quality solutions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009182a.html [article] Meta-heuristic algorithms for wafer sorting scheduling problems [texte imprimé] / Lin, Shih-Wei, Auteur ; Lee, Zne-Jung, Auteur ; Ying, Kuo-Ching, Auteur . - 2011 . - pp. 165–174. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 165–174 Mots-clés : Wafer  sorting  scheduling  problem  Meta-heuristic  Parallel  machine  scheduling  problem Index. décimale : 001.424 Résumé : Wafer sorting is usually regarded as the most critical stage in the whole wafer probing process. This paper discusses the wafer sorting scheduling problem (WSSP) with total setup time minimization as the primary criterion and the minimization of the number of machines used as the secondary criterion. Although the need to consider multiple criteria in real-world WSSPs is widely recognized, the present study is the first attempt to investigate this argument with setups consideration. In view of the strongly NP-hard nature of this problem, three meta-heuristic algorithms—an ant colony system algorithm, a Genetic algorithm, and a Tabu search algorithm are proposed. The proposed meta-heuristics are empirically evaluated by 480 simulation instances based on the characteristics of a real wafer testing shop-floor and found to be very effective in terms of finding good quality solutions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009182a.html

A new approach for generating efficient solutions within the goal programming model / Larbani, M. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 175–182 Titre : A new approach for generating efficient solutions within the goal programming model Type de document : texte imprimé Auteurs : Larbani, M., Auteur ; Aouni, B., Auteur Année de publication : 2011 Article en page(s) : pp. 175–182 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Goal  programming  Efficiency  Pareto  optimality Index. décimale : 001.424 Résumé : This paper deals with the issue of efficiency in the Goal Programming (GP) model. A general approach for the determination of an efficient solution of GP is presented. An efficiency test for the GP solution is developed; moreover, when this solution is not efficient, an efficient solution that dominates it is determined. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009185a.html [article] A new approach for generating efficient solutions within the goal programming model [texte imprimé] / Larbani, M., Auteur ; Aouni, B., Auteur . - 2011 . - pp. 175–182. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 175–182 Mots-clés : Goal  programming  Efficiency  Pareto  optimality Index. décimale : 001.424 Résumé : This paper deals with the issue of efficiency in the Goal Programming (GP) model. A general approach for the determination of an efficient solution of GP is presented. An efficiency test for the GP solution is developed; moreover, when this solution is not efficient, an efficient solution that dominates it is determined. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009185a.html

A parallel improved ant colony optimization for multi-depot vehicle routing problem / Yu, B. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 183–188 Titre : A parallel improved ant colony optimization for multi-depot vehicle routing problem Type de document : texte imprimé Auteurs : Yu, B., Auteur ; Yang, Z.-Z., Auteur ; Xie, J.-X., Auteur Année de publication : 2011 Article en page(s) : pp. 183–188 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Multi-depot  vehicle  routing  problem  Virtual  central  depot  Ant  colony  optimization  Ant-weight  Mutation  operation Index. décimale : 001.424 Résumé : This paper presents a method for solving multi-depot vehicle routing problem (MDVRP). First, a virtual central depot is added to transfer MDVRP to the multi-depot vehicle routing problem with the virtual central depot (V-MDVRP), which is similar to a vehicle routing problem (VRP) with the virtual central depot as the origin. An improved ant colony optimization with coarse-grain parallel strategy, ant-weight strategy and mutation operation, is presented for the V-MDVRP. The computational results for 23 benchmark problems are reported and compared to those of other ant colony optimizations. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009161a.html [article] A parallel improved ant colony optimization for multi-depot vehicle routing problem [texte imprimé] / Yu, B., Auteur ; Yang, Z.-Z., Auteur ; Xie, J.-X., Auteur . - 2011 . - pp. 183–188. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 183–188 Mots-clés : Multi-depot  vehicle  routing  problem  Virtual  central  depot  Ant  colony  optimization  Ant-weight  Mutation  operation Index. décimale : 001.424 Résumé : This paper presents a method for solving multi-depot vehicle routing problem (MDVRP). First, a virtual central depot is added to transfer MDVRP to the multi-depot vehicle routing problem with the virtual central depot (V-MDVRP), which is similar to a vehicle routing problem (VRP) with the virtual central depot as the origin. An improved ant colony optimization with coarse-grain parallel strategy, ant-weight strategy and mutation operation, is presented for the V-MDVRP. The computational results for 23 benchmark problems are reported and compared to those of other ant colony optimizations. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009161a.html

An application of reference point techniques to the calculation of synthetic sustainability indicators / Ruiz, F. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 189–197 Titre : An application of reference point techniques to the calculation of synthetic sustainability indicators Type de document : texte imprimé Auteurs : Ruiz, F., Auteur ; Cabello, J. M., Auteur ; Luque, M., Auteur Année de publication : 2011 Article en page(s) : pp. 189–197 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Multicriteria  analysis  Reference  point  techniques  Synthetic  indicators  Sustainability  Reservation–aspiration Index. décimale : 001.424 Résumé : Sustainability is nowadays a key factor to analyse the development of the societies. Therefore, measuring sustainability is a main concern of the scientific community. The basic necessity to simultaneously consider the economical, social and environmental aspects make sustainability, by nature, a multicriteria concept, and therefore, multicriteria techniques are to be used to measure it. In this paper, we propose a method to develop synthetic sustainability indicators, based on the double (reservation–aspiration) reference point approach. This scheme is applied to each territorial unit considered, in order to determine, on the base of a given set of indicators, a couple of synthetic indicators that measure the weak and the strong sustainability of the unit. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009187a.html [article] An application of reference point techniques to the calculation of synthetic sustainability indicators [texte imprimé] / Ruiz, F., Auteur ; Cabello, J. M., Auteur ; Luque, M., Auteur . - 2011 . - pp. 189–197. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 189–197 Mots-clés : Multicriteria  analysis  Reference  point  techniques  Synthetic  indicators  Sustainability  Reservation–aspiration Index. décimale : 001.424 Résumé : Sustainability is nowadays a key factor to analyse the development of the societies. Therefore, measuring sustainability is a main concern of the scientific community. The basic necessity to simultaneously consider the economical, social and environmental aspects make sustainability, by nature, a multicriteria concept, and therefore, multicriteria techniques are to be used to measure it. In this paper, we propose a method to develop synthetic sustainability indicators, based on the double (reservation–aspiration) reference point approach. This scheme is applied to each territorial unit considered, in order to determine, on the base of a given set of indicators, a couple of synthetic indicators that measure the weak and the strong sustainability of the unit. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009187a.html

Robust parameter design optimization of simulation experiments using stochastic perturbation methods / Miranda, A. K. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 198–205 Titre : Robust parameter design optimization of simulation experiments using stochastic perturbation methods Type de document : texte imprimé Auteurs : Miranda, A. K., Auteur ; Del Castillo, E., Auteur Année de publication : 2011 Article en page(s) : pp. 198–205 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Simulation  optimization  Noise  factors  Crossed  arrays  Non-homogeneous  variance Index. décimale : 001.424 Résumé : Stochastic perturbation methods can be applied to problems for which either the objective function is represented analytically, or the objective function is the result of a simulation experiment. The Simultaneous Perturbation Stochastic Approximation (SPSA) method has the advantage over similar methods of requiring only two measurements at each iteration of the search. This feature makes SPSA attractive for robust parameter design (RPD) problems where some factors affect the variance of the response(s) of interest. In this paper, the feasibility of SPSA as a RPD optimizer is presented, first when the objective function is known, and then when the objective function is estimated by means of a discrete-event simulation. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009163a.html [article] Robust parameter design optimization of simulation experiments using stochastic perturbation methods [texte imprimé] / Miranda, A. K., Auteur ; Del Castillo, E., Auteur . - 2011 . - pp. 198–205. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 198–205 Mots-clés : Simulation  optimization  Noise  factors  Crossed  arrays  Non-homogeneous  variance Index. décimale : 001.424 Résumé : Stochastic perturbation methods can be applied to problems for which either the objective function is represented analytically, or the objective function is the result of a simulation experiment. The Simultaneous Perturbation Stochastic Approximation (SPSA) method has the advantage over similar methods of requiring only two measurements at each iteration of the search. This feature makes SPSA attractive for robust parameter design (RPD) problems where some factors affect the variance of the response(s) of interest. In this paper, the feasibility of SPSA as a RPD optimizer is presented, first when the objective function is known, and then when the objective function is estimated by means of a discrete-event simulation. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009163a.html

A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects / Kuo, W.-H. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 206–210 Titre : A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects Type de document : texte imprimé Auteurs : Kuo, W.-H., Auteur ; Yang, D.-L., Auteur Année de publication : 2011 Article en page(s) : pp. 206–210 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Single-machine  Deteriorating  jobs  Learning  effects Index. décimale : 001.424 Résumé : The concepts of deteriorating jobs and learning effects have been individually studied in many scheduling problems. This note considers a single-machine scheduling problem with deteriorating jobs and learning effects. All of the jobs have a common (but unknown) due date. The objective is to minimize the sum of the weighted earliness, tardiness and due-date penalties. An O(n3) algorithm is proposed to optimally solve the problem with deteriorating jobs and job-dependent learning effect. Besides, an O(n log n) algorithm is provided to solve the problem with deteriorating jobs and job-independent learning effect. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009155a.html [article] A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects [texte imprimé] / Kuo, W.-H., Auteur ; Yang, D.-L., Auteur . - 2011 . - pp. 206–210. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 206–210 Mots-clés : Scheduling  Single-machine  Deteriorating  jobs  Learning  effects Index. décimale : 001.424 Résumé : The concepts of deteriorating jobs and learning effects have been individually studied in many scheduling problems. This note considers a single-machine scheduling problem with deteriorating jobs and learning effects. All of the jobs have a common (but unknown) due date. The objective is to minimize the sum of the weighted earliness, tardiness and due-date penalties. An O(n3) algorithm is proposed to optimally solve the problem with deteriorating jobs and job-dependent learning effect. Besides, an O(n log n) algorithm is provided to solve the problem with deteriorating jobs and job-independent learning effect. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009155a.html

The effect of oil price on containership speed and fleet size / Ronen, D. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 211–216 Titre : The effect of oil price on containership speed and fleet size Type de document : texte imprimé Auteurs : Ronen, D., Auteur Année de publication : 2011 Article en page(s) : pp. 211–216 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Sea  transport  Liner  shipping  Oil  price  Optimal  speed  Containership  fleet  size Index. décimale : 001.424 Résumé : The changing prices of bunker fuel open the door for substantial cost savings by adjusting the sailing speed of ships. A large ship may be burning up to 100 000 USD of bunker fuel per day, which may constitute more than 75% of its operating costs. Reducing the cruising speed by 20% reduces daily bunker consumption by 50%. However, in order to maintain liner service frequency and capacity, reducing the cruising speed may require additional ships to operate a route. We construct a cost model that we use to analyse the trade-off between speed reduction and adding vessels to a container line route, and devise a simple procedure to identify the sailing speed and number of vessels that minimize the annual operating cost of the route. Using published data, we demonstrate the potential for large-cost savings when one operates close to the minimal-cost speed. The presented methodology and procedure are applicable for any bunker fuel price. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009169a.html [article] The effect of oil price on containership speed and fleet size [texte imprimé] / Ronen, D., Auteur . - 2011 . - pp. 211–216. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 211–216 Mots-clés : Sea  transport  Liner  shipping  Oil  price  Optimal  speed  Containership  fleet  size Index. décimale : 001.424 Résumé : The changing prices of bunker fuel open the door for substantial cost savings by adjusting the sailing speed of ships. A large ship may be burning up to 100 000 USD of bunker fuel per day, which may constitute more than 75% of its operating costs. Reducing the cruising speed by 20% reduces daily bunker consumption by 50%. However, in order to maintain liner service frequency and capacity, reducing the cruising speed may require additional ships to operate a route. We construct a cost model that we use to analyse the trade-off between speed reduction and adding vessels to a container line route, and devise a simple procedure to identify the sailing speed and number of vessels that minimize the annual operating cost of the route. Using published data, we demonstrate the potential for large-cost savings when one operates close to the minimal-cost speed. The presented methodology and procedure are applicable for any bunker fuel price. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009169a.html

A model for timetabling problems with period spread constraints / Lara-Velázquez, P. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 217–222 Titre : A model for timetabling problems with period spread constraints Type de document : texte imprimé Auteurs : Lara-Velázquez, P., Auteur ; López-Bracho, R., Auteur ; Ramírez-Rodríguez, J., Auteur Année de publication : 2011 Article en page(s) : pp. 217–222 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Heuristics  Lecture-timetabling  Robust  colouring Index. décimale : 001.424 Résumé : The generalized robust colouring problem (GRCP) deals with a robust colouring for a given graph with a fixed number of colours, not necessarily the chromatic number and considers the distance between colours as the penalization of complementary edges. This problem provides a way to solve timetabling problems that consider ‘event spread constraints’ such as ‘there must be at least d days between two events’. Because this problem is NP-hard, a heuristic approach is necessary to produce good solutions in a reasonable amount of time for large instances. In this work a greedy randomized adaptive search procedure (GRASP) is proposed to solve GRCP, which was used in instances to schedule course lectures requiring from 30 to 120 h per week in total, in which the bound of the optimal solution is reached in almost every instance. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009173a.html [article] A model for timetabling problems with period spread constraints [texte imprimé] / Lara-Velázquez, P., Auteur ; López-Bracho, R., Auteur ; Ramírez-Rodríguez, J., Auteur . - 2011 . - pp. 217–222. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 217–222 Mots-clés : Heuristics  Lecture-timetabling  Robust  colouring Index. décimale : 001.424 Résumé : The generalized robust colouring problem (GRCP) deals with a robust colouring for a given graph with a fixed number of colours, not necessarily the chromatic number and considers the distance between colours as the penalization of complementary edges. This problem provides a way to solve timetabling problems that consider ‘event spread constraints’ such as ‘there must be at least d days between two events’. Because this problem is NP-hard, a heuristic approach is necessary to produce good solutions in a reasonable amount of time for large instances. In this work a greedy randomized adaptive search procedure (GRASP) is proposed to solve GRCP, which was used in instances to schedule course lectures requiring from 30 to 120 h per week in total, in which the bound of the optimal solution is reached in almost every instance. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009173a.html

A robust enhancement to the Clarke–Wright savings algorithm / Doyuran, T. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 223–231 Titre : A robust enhancement to the Clarke–Wright savings algorithm Type de document : texte imprimé Auteurs : Doyuran, T., Auteur ; Çatay, B., Auteur Année de publication : 2011 Article en page(s) : pp. 223–231 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Vehicle  routing  Clarke–Wright  savings  algorithm  Heuristics Index. décimale : 001.424 Résumé : We address the Clarke and Wright (CW) savings algorithm proposed for the Capacitated Vehicle Routing Problem. We first consider a recent enhancement that uses the put first larger items idea originally proposed for the bin packing problem and show that the conflicting idea of putting smaller items first has a comparable performance. Next, we propose a robust enhancement to the CW savings formulation. The proposed formulation is normalized to efficiently solve different problems, independent from the measurement units and parameter intervals. To test the performance of the proposed savings function, we conduct an extensive computational study on a large set of well-known instances from the literature. Our results show that the proposed savings function provides shorter distances in the majority of the instances and the average performance is significantly better than previously presented enhancements. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009176a.html [article] A robust enhancement to the Clarke–Wright savings algorithm [texte imprimé] / Doyuran, T., Auteur ; Çatay, B., Auteur . - 2011 . - pp. 223–231. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 223–231 Mots-clés : Vehicle  routing  Clarke–Wright  savings  algorithm  Heuristics Index. décimale : 001.424 Résumé : We address the Clarke and Wright (CW) savings algorithm proposed for the Capacitated Vehicle Routing Problem. We first consider a recent enhancement that uses the put first larger items idea originally proposed for the bin packing problem and show that the conflicting idea of putting smaller items first has a comparable performance. Next, we propose a robust enhancement to the CW savings formulation. The proposed formulation is normalized to efficiently solve different problems, independent from the measurement units and parameter intervals. To test the performance of the proposed savings function, we conduct an extensive computational study on a large set of well-known instances from the literature. Our results show that the proposed savings function provides shorter distances in the majority of the instances and the average performance is significantly better than previously presented enhancements. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009176a.html

New constructive heuristics for the total weighted tardiness problem / Yoon, S. H. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 232–237 Titre : New constructive heuristics for the total weighted tardiness problem Type de document : texte imprimé Auteurs : Yoon, S. H., Auteur ; Lee, I. S., Auteur Année de publication : 2011 Article en page(s) : pp. 232–237 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Single-machine  scheduling  Total  weighted  tardiness  Constructive  heuristics Index. décimale : 001.424 Résumé : This note considers the single-machine total weighted tardiness problem. Three new heuristic algorithms are suggested and compared with other competing heuristics from the literature, such as Apparent Tardiness Cost, Weighted Covert and Weighted Modified Due Date. The experimental tests show that the suggested heuristic algorithms outperform the existing heuristics. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009186a.html [article] New constructive heuristics for the total weighted tardiness problem [texte imprimé] / Yoon, S. H., Auteur ; Lee, I. S., Auteur . - 2011 . - pp. 232–237. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 232–237 Mots-clés : Single-machine  scheduling  Total  weighted  tardiness  Constructive  heuristics Index. décimale : 001.424 Résumé : This note considers the single-machine total weighted tardiness problem. Three new heuristic algorithms are suggested and compared with other competing heuristics from the literature, such as Apparent Tardiness Cost, Weighted Covert and Weighted Modified Due Date. The experimental tests show that the suggested heuristic algorithms outperform the existing heuristics. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009186a.html

A note: a due-window assignment problem on parallel identical machines / Mosheiov, G. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 238–241 Titre : A note: a due-window assignment problem on parallel identical machines Type de document : texte imprimé Auteurs : Mosheiov, G., Auteur ; Sarig, A., Auteur Année de publication : 2011 Article en page(s) : pp. 238–241 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Parallel  machines  Earliness–tardiness  Due-window  Assignment  problem Index. décimale : 001.424 Résumé : We solve a due-window assignment problem on parallel identical machines. In addition to the standard objective of finding the optimal job schedule, in due-window assignment problems one has to assign a time interval during which goods are delivered to customers with no cost. Jobs scheduled prior to or after the due-window are penalized according to their earliness/tardiness value. We assume that jobs have identical processing times, but may have job-dependent earliness and tardiness costs (eg, due to possible different destinations). We show that the problem can be reduced to a non-standard asymmetric assignment problem, and introduce an efficient (O(n4)) solution procedure. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009179a.html [article] A note: a due-window assignment problem on parallel identical machines [texte imprimé] / Mosheiov, G., Auteur ; Sarig, A., Auteur . - 2011 . - pp. 238–241. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 238–241 Mots-clés : Scheduling  Parallel  machines  Earliness–tardiness  Due-window  Assignment  problem Index. décimale : 001.424 Résumé : We solve a due-window assignment problem on parallel identical machines. In addition to the standard objective of finding the optimal job schedule, in due-window assignment problems one has to assign a time interval during which goods are delivered to customers with no cost. Jobs scheduled prior to or after the due-window are penalized according to their earliness/tardiness value. We assume that jobs have identical processing times, but may have job-dependent earliness and tardiness costs (eg, due to possible different destinations). We show that the problem can be reduced to a non-standard asymmetric assignment problem, and introduce an efficient (O(n4)) solution procedure. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009179a.html

The relationship between operational research and systems thinking / Ormerod, R. J. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 242–245 Titre : The relationship between operational research and systems thinking Type de document : texte imprimé Auteurs : Ormerod, R. J., Auteur Année de publication : 2011 Article en page(s) : pp. 242–245 Note générale : Recherche opérationnelle Langues : Anglais (eng) Index. décimale : 001.424 DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors20106a.html [article] The relationship between operational research and systems thinking [texte imprimé] / Ormerod, R. J., Auteur . - 2011 . - pp. 242–245. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 242–245 Index. décimale : 001.424 DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors20106a.html

Exemplaires

Bibliothèque Ecole Nationale Polytechnique d'Alger

Accueil

Se connecter

Météo

Adresse