Pub Date : 2015-10-01DOI: 10.1109/IESM.2015.7380280
S. Hennequin
In this regular session many aspects of production problems are developed with regards to the following topics: Some topics developed in this session: • Inventory model; • Manufacturing environments; • Maintenance optimization; • Fuzzy Hierarchical; • Quality Management System; • Dynamic lot-sizing; • Optimization. Presented papers: • Buffer allocation, machine selection and preventive maintenance optimization in unreliable production lines • Comparative Study of Fuzzy Hierarchical Hybrid Approaches for Control of Quality Management System • A Fuzzy Hedging Point Policy for Sustainable Manufacturing System • Dynamic lot-sizing-based working capital requirement minimization model with infinite capacity • Local and global optimization in raw material processing
{"title":"Regular session production - 1","authors":"S. Hennequin","doi":"10.1109/IESM.2015.7380280","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380280","url":null,"abstract":"In this regular session many aspects of production problems are developed with regards to the following topics: Some topics developed in this session: • Inventory model; • Manufacturing environments; • Maintenance optimization; • Fuzzy Hierarchical; • Quality Management System; • Dynamic lot-sizing; • Optimization. Presented papers: • Buffer allocation, machine selection and preventive maintenance optimization in unreliable production lines • Comparative Study of Fuzzy Hierarchical Hybrid Approaches for Control of Quality Management System • A Fuzzy Hedging Point Policy for Sustainable Manufacturing System • Dynamic lot-sizing-based working capital requirement minimization model with infinite capacity • Local and global optimization in raw material processing","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132260237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-10-01DOI: 10.1109/IESM.2015.7380250
Hannah de Oliveira Santos, Javier Gonzalez Benito, G. Lannelongue
Supply Chain Management (SCM) has often been discussed and studied by academics and practitioners over the last two decades. One reason for the growing interest in SCM is that a company's performance is no longer solely determined by the decisions it makes and actions it takes, but also by the contribution and performance of all the members along the supply chain. This study examines the academic literature on SCM. The aim is not to perform an exhaustive analysis. Rather, the goal is to carry out a representative work. This article interconnects two study areas: supply chain management and organizational performance. The analysis was based on 172 academic articles. This study helps to identify opportunities and weaknesses in the field of operations management and helps researchers to find trends that could support future studies in SCM.
{"title":"Supply Chain Management and performance: A bibliometric analysis","authors":"Hannah de Oliveira Santos, Javier Gonzalez Benito, G. Lannelongue","doi":"10.1109/IESM.2015.7380250","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380250","url":null,"abstract":"Supply Chain Management (SCM) has often been discussed and studied by academics and practitioners over the last two decades. One reason for the growing interest in SCM is that a company's performance is no longer solely determined by the decisions it makes and actions it takes, but also by the contribution and performance of all the members along the supply chain. This study examines the academic literature on SCM. The aim is not to perform an exhaustive analysis. Rather, the goal is to carry out a representative work. This article interconnects two study areas: supply chain management and organizational performance. The analysis was based on 172 academic articles. This study helps to identify opportunities and weaknesses in the field of operations management and helps researchers to find trends that could support future studies in SCM.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114917069","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-10-01DOI: 10.1109/IESM.2015.7380254
M. Bustillo, Borja Menéndez, Eduardo G. Pardo, A. Duarte
Order Batching is an optimization problem related to the picking process of orders in a warehouse. It consists in grouping the orders (each order is composed by a list of items to be collected) received in a warehouse in a set of batches of a maximum fixed capacity. Then, a route to collect the items in the same batch must be conformed. In this paper we tackle a variant of this problem known as Order Batching and Sequencing Problem where each order has a certain due date. This variant consists in grouping the orders into batches and then sequencing them, in such a way that the tardiness of each order (the extra time over the due date needed to collect it) is minimized. In this paper we propose a Variable Neighborhood Search algorithm to tackle the problem. Our approach outperforms previous attempts in the state of the art.
{"title":"An algorithm for batching, sequencing and picking operations in a warehouse","authors":"M. Bustillo, Borja Menéndez, Eduardo G. Pardo, A. Duarte","doi":"10.1109/IESM.2015.7380254","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380254","url":null,"abstract":"Order Batching is an optimization problem related to the picking process of orders in a warehouse. It consists in grouping the orders (each order is composed by a list of items to be collected) received in a warehouse in a set of batches of a maximum fixed capacity. Then, a route to collect the items in the same batch must be conformed. In this paper we tackle a variant of this problem known as Order Batching and Sequencing Problem where each order has a certain due date. This variant consists in grouping the orders into batches and then sequencing them, in such a way that the tardiness of each order (the extra time over the due date needed to collect it) is minimized. In this paper we propose a Variable Neighborhood Search algorithm to tackle the problem. Our approach outperforms previous attempts in the state of the art.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128224189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-10-01DOI: 10.1109/iesm.2015.7380245
A. Barbosa‐Póvoa
Some aspects of research supply chains problems are proposed in this regular session.
在本次例会上提出了研究供应链问题的一些方面。
{"title":"Supply chain","authors":"A. Barbosa‐Póvoa","doi":"10.1109/iesm.2015.7380245","DOIUrl":"https://doi.org/10.1109/iesm.2015.7380245","url":null,"abstract":"Some aspects of research supply chains problems are proposed in this regular session.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128270752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-10-01DOI: 10.1109/IESM.2015.7380176
Shouyu Ma, E. Sahin, Y. Dallery, Z. Jemai
Retailers are confronted to make ordering decisions for a large category of products offered to end consumers. In this paper, we extend the classical mono-product News-Vendor Problem to a multi-product News-Vendor Problem with demand transferring and demand substitution. We focus on the joint determination of optimal product assortment and optimal order quantities. Computational algorithms are presented to solve the problem. We compare the global optimization policy with some other policies used in practice by numerical examples.
{"title":"Assortment decision in the multi-product News-Vendor Problem with demand substitution","authors":"Shouyu Ma, E. Sahin, Y. Dallery, Z. Jemai","doi":"10.1109/IESM.2015.7380176","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380176","url":null,"abstract":"Retailers are confronted to make ordering decisions for a large category of products offered to end consumers. In this paper, we extend the classical mono-product News-Vendor Problem to a multi-product News-Vendor Problem with demand transferring and demand substitution. We focus on the joint determination of optimal product assortment and optimal order quantities. Computational algorithms are presented to solve the problem. We compare the global optimization policy with some other policies used in practice by numerical examples.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"209 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124693374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-10-01DOI: 10.1109/IESM.2015.7380315
A. Fontana, M. Cinus, Marzio Sorlini, M. Alge, L. Canetta, A. Maggi
Maintenance impacts on environmental, economical and social performances of a product are often overlooked or underestimated. Especially for durable goods, maintenance should positively influence the product sustainability profile extending its lifespan, but, negatively, it also adds operations and materials usage. Available sustainability (mostly environmental) assessment tools either do not consider maintenance impacts, or compute them just for already produced products, this extremely limiting (or even inhibiting) the capability to improve the sustainability profile of under-design products. The here presented tool, based on a Naïve Bayes Classifier, real-timely computes the sustainability performances of under-design moulds, thus advising the mould designer towards better performing design choices. The paper presents the tool development process and achieved results, exploiting the advantages of the selected target product: a long-lasting, frequently maintained capital good.
{"title":"An advisory tool for sustainability-driven maintenance. A real case in mould and die industry","authors":"A. Fontana, M. Cinus, Marzio Sorlini, M. Alge, L. Canetta, A. Maggi","doi":"10.1109/IESM.2015.7380315","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380315","url":null,"abstract":"Maintenance impacts on environmental, economical and social performances of a product are often overlooked or underestimated. Especially for durable goods, maintenance should positively influence the product sustainability profile extending its lifespan, but, negatively, it also adds operations and materials usage. Available sustainability (mostly environmental) assessment tools either do not consider maintenance impacts, or compute them just for already produced products, this extremely limiting (or even inhibiting) the capability to improve the sustainability profile of under-design products. The here presented tool, based on a Naïve Bayes Classifier, real-timely computes the sustainability performances of under-design moulds, thus advising the mould designer towards better performing design choices. The paper presents the tool development process and achieved results, exploiting the advantages of the selected target product: a long-lasting, frequently maintained capital good.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125639457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-10-01DOI: 10.1109/IESM.2015.7380163
K. Ghanes, O. Jouini, M. Wargon, Z. Jemai
Emergency departments are facing a worldwide problem that affects their performance, namely Overcrowding. Triage Nurse Ordering appears to be a promising approach in addition to be cost effective. This paper proposes a process-based triage nurse ordering model and assesses its efficiency on the ED performance through simulation while considering the length of stay as the key indicator. The study examines the impact of triage nurse ability, system load and triage time extension on the benefits that might be derived from triage nurse ordering.
{"title":"Modeling and analysis of triage nurse ordering in emergency departments","authors":"K. Ghanes, O. Jouini, M. Wargon, Z. Jemai","doi":"10.1109/IESM.2015.7380163","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380163","url":null,"abstract":"Emergency departments are facing a worldwide problem that affects their performance, namely Overcrowding. Triage Nurse Ordering appears to be a promising approach in addition to be cost effective. This paper proposes a process-based triage nurse ordering model and assesses its efficiency on the ED performance through simulation while considering the length of stay as the key indicator. The study examines the impact of triage nurse ability, system load and triage time extension on the benefits that might be derived from triage nurse ordering.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127797444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-10-01DOI: 10.1109/IESM.2015.7380162
F. Harrou, Ying Sun, F. Kadri, S. Chaabane, C. Tahon
Overcrowding is one of the most crucial issues confronting emergency departments (EDs) throughout the world. Efficient management of patient flows for ED services has become an urgent issue for most hospital administrations. Handling and detection of abnormal situations is a key challenge in EDs. Thus, the early detection of abnormal patient arrivals at EDs plays an important role from the point of view of improving management of the inspected EDs. It allows the EDs mangers to prepare for high levels of care activities, to optimize the internal resources and to predict enough hospitalization capacity in downstream care services. This study reports the development of statistical method for enhancing detection of abnormal daily patient arrivals at the ED, which able to provide early alert mechanisms in the event of abnormal situations. The autoregressive moving average (ARMA)-based exponentially weighted moving average (EWMA) anomaly detection scheme proposed was successfully applied to the practical data collected from the database of the pediatric emergency department (PED) at Lille regional hospital center, France.
{"title":"Early detection of abnormal patient arrivals at hospital emergency department","authors":"F. Harrou, Ying Sun, F. Kadri, S. Chaabane, C. Tahon","doi":"10.1109/IESM.2015.7380162","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380162","url":null,"abstract":"Overcrowding is one of the most crucial issues confronting emergency departments (EDs) throughout the world. Efficient management of patient flows for ED services has become an urgent issue for most hospital administrations. Handling and detection of abnormal situations is a key challenge in EDs. Thus, the early detection of abnormal patient arrivals at EDs plays an important role from the point of view of improving management of the inspected EDs. It allows the EDs mangers to prepare for high levels of care activities, to optimize the internal resources and to predict enough hospitalization capacity in downstream care services. This study reports the development of statistical method for enhancing detection of abnormal daily patient arrivals at the ED, which able to provide early alert mechanisms in the event of abnormal situations. The autoregressive moving average (ARMA)-based exponentially weighted moving average (EWMA) anomaly detection scheme proposed was successfully applied to the practical data collected from the database of the pediatric emergency department (PED) at Lille regional hospital center, France.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126206623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-10-01DOI: 10.1109/IESM.2015.7380205
P. Baptiste, D. Rebaine, Mohammed Zouba
We address in this paper the problem of scheduling a set of independent and non-preemptive jobs on two identical parallel machines with a single operator in order to minimize the makespan. The operator supervises the machines through a subset of a given set of modi operandi: the working modes. A working mode models the way the operator divides up his interventions between the machines. The processing times thus become variable as they now depend on the working mode being utilized. To build a schedule, we seek not only a partition of the jobs on the machines, but also a subset of working modes along with their duration. A pseudo-polynomial time algorithm is exhibited to generate an optimal solution within the free changing mode. Polynomial and and fully polynomial approximation scheme algorithms (respectively PTAS and FPTAS) are then derived.
{"title":"Solving the two identical parallel machine problem with a single operator","authors":"P. Baptiste, D. Rebaine, Mohammed Zouba","doi":"10.1109/IESM.2015.7380205","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380205","url":null,"abstract":"We address in this paper the problem of scheduling a set of independent and non-preemptive jobs on two identical parallel machines with a single operator in order to minimize the makespan. The operator supervises the machines through a subset of a given set of modi operandi: the working modes. A working mode models the way the operator divides up his interventions between the machines. The processing times thus become variable as they now depend on the working mode being utilized. To build a schedule, we seek not only a partition of the jobs on the machines, but also a subset of working modes along with their duration. A pseudo-polynomial time algorithm is exhibited to generate an optimal solution within the free changing mode. Polynomial and and fully polynomial approximation scheme algorithms (respectively PTAS and FPTAS) are then derived.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124332881","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-10-01DOI: 10.1109/IESM.2015.7380149
Sara Hatami, Rubén Ruiz, C. Andrés-Romano
In this paper we study a production scheduling problem with production and assembly stages. There is a set of distributed identical factories, each one with a set of unrelated parallel machines at the production stage and a single assembly machine in the assembly stage. Jobs have to be assigned to one of the distributed factories and processed by one of the unrelated parallel machines. Processed jobs are assembled into final products through a defined assembly program in the assembly stage. This problem is referred to as the Distributed Parallel Machine Assembly Scheduling Problem or DPMASP. Minimizing the makespan of the products in the assembly stage is considered as the objective. Because of technological constraints, some factories are bit able to process some jobs and empty machines at factories are permitted. We present a mathematical model, four simple, fast and high performing heuristics to solve the considered problem. CPLEX and GUROBI as two state-ofthe- art commercial solvers are used to solve the mathematical model. Comprehensive computational experiments and ANOVA statistical analyses are performed to evaluate the performance of the proposed mathematical model and heuristics. Our results show that the mathematical model is able to solve moderatelysized instances and some of the heuristics report solutions that are very close to optimality in negligible CPU times.
{"title":"Heuristics for a Distributed Parallel Machine Assembly Scheduling Problem with eligibility constraints","authors":"Sara Hatami, Rubén Ruiz, C. Andrés-Romano","doi":"10.1109/IESM.2015.7380149","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380149","url":null,"abstract":"In this paper we study a production scheduling problem with production and assembly stages. There is a set of distributed identical factories, each one with a set of unrelated parallel machines at the production stage and a single assembly machine in the assembly stage. Jobs have to be assigned to one of the distributed factories and processed by one of the unrelated parallel machines. Processed jobs are assembled into final products through a defined assembly program in the assembly stage. This problem is referred to as the Distributed Parallel Machine Assembly Scheduling Problem or DPMASP. Minimizing the makespan of the products in the assembly stage is considered as the objective. Because of technological constraints, some factories are bit able to process some jobs and empty machines at factories are permitted. We present a mathematical model, four simple, fast and high performing heuristics to solve the considered problem. CPLEX and GUROBI as two state-ofthe- art commercial solvers are used to solve the mathematical model. Comprehensive computational experiments and ANOVA statistical analyses are performed to evaluate the performance of the proposed mathematical model and heuristics. Our results show that the mathematical model is able to solve moderatelysized instances and some of the heuristics report solutions that are very close to optimality in negligible CPU times.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122650168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：