Pub Date : 2015-10-21DOI: 10.1109/IESM.2015.7380260
Margaux Nattaf, C. Artigues, P. Lopez, R. Medina, V. Parada, L. Pradenas
This paper considers a production scheduling problem in a Chilean company from the metalworking industry. This company produces steel balls of different diameters on parallel production lines. There are different types of production lines and each production line may have a different speed for producing each diameter. Furthermore a setup time occurs when changing the diameter produced on each machine. Besides these production and setup operations, maintenance operations have to be scheduled. These electrical machines yield high energy demands. It is therefore crucial to minimize total energy consumption, which depends on batch/machine assignment, and maximum demand on peak hours. We consider the batch sizing and scheduling problem involving electricity costs in a non-uniform parallel machine context. Given a demand for each family of steel balls, the problem consists in splitting the demand in sublots (batches) that have to be assigned and scheduled on the parallel machines together with the required maintenance operations. The goal is to complete the schedule before a common deadline while minimizing electricity costs. We propose to tackle this problem through mixed integer linear programming. We propose a global formulation and a two-phase matheuristic. Computational results on realistic instances are provided.
{"title":"A batch sizing and scheduling problem on parallel machines with different speeds, maintenance operations, setup times and energy costs","authors":"Margaux Nattaf, C. Artigues, P. Lopez, R. Medina, V. Parada, L. Pradenas","doi":"10.1109/IESM.2015.7380260","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380260","url":null,"abstract":"This paper considers a production scheduling problem in a Chilean company from the metalworking industry. This company produces steel balls of different diameters on parallel production lines. There are different types of production lines and each production line may have a different speed for producing each diameter. Furthermore a setup time occurs when changing the diameter produced on each machine. Besides these production and setup operations, maintenance operations have to be scheduled. These electrical machines yield high energy demands. It is therefore crucial to minimize total energy consumption, which depends on batch/machine assignment, and maximum demand on peak hours. We consider the batch sizing and scheduling problem involving electricity costs in a non-uniform parallel machine context. Given a demand for each family of steel balls, the problem consists in splitting the demand in sublots (batches) that have to be assigned and scheduled on the parallel machines together with the required maintenance operations. The goal is to complete the schedule before a common deadline while minimizing electricity costs. We propose to tackle this problem through mixed integer linear programming. We propose a global formulation and a two-phase matheuristic. Computational results on realistic instances are provided.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131645288","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-21DOI: 10.1109/IESM.2015.7380292
Jing Peng, O. Jouini, Y. Dallery, Z. Jemai
We study the cost-sharing problem among independent service providers in a service capacity pooling system. The effective improvement of such pooling system can be achieved by reducing the resource idleness in case of congestion. In this paper, we model both the service provider and the cooperative coalition as a single server queue. We attempt to answer the following questions: (i) which coalition strategy should be used; and (ii) which allocation rule should be selected in order to maintain the stability of the coalition? In particular, we consider the service pooling with a fixed service capacity for M/G/1 service systems. The benefit of the pooling system is due to the shortened waiting queue in the overall system. We develop the corresponding cooperative game with transferable utility, and analyze the core allocations. Although it is difficult to express a core allocation explicitly for the game, we prove the non-emptiness of the core. We give a reasonable expression of Equal Profit Method to distribute the cost for our game, and investigate a number of cost allocation rules under three typical situations to evaluate the gain of the service pooling strategy for each service provider. The numerical results show that the cost allocation rule proposed gives a reasonable cost-sharing result considering the contribution of each participant.
{"title":"Service capacity pooling in M/G/1 service systems","authors":"Jing Peng, O. Jouini, Y. Dallery, Z. Jemai","doi":"10.1109/IESM.2015.7380292","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380292","url":null,"abstract":"We study the cost-sharing problem among independent service providers in a service capacity pooling system. The effective improvement of such pooling system can be achieved by reducing the resource idleness in case of congestion. In this paper, we model both the service provider and the cooperative coalition as a single server queue. We attempt to answer the following questions: (i) which coalition strategy should be used; and (ii) which allocation rule should be selected in order to maintain the stability of the coalition? In particular, we consider the service pooling with a fixed service capacity for M/G/1 service systems. The benefit of the pooling system is due to the shortened waiting queue in the overall system. We develop the corresponding cooperative game with transferable utility, and analyze the core allocations. Although it is difficult to express a core allocation explicitly for the game, we prove the non-emptiness of the core. We give a reasonable expression of Equal Profit Method to distribute the cost for our game, and investigate a number of cost allocation rules under three typical situations to evaluate the gain of the service pooling strategy for each service provider. The numerical results show that the cost allocation rule proposed gives a reasonable cost-sharing result considering the contribution of each participant.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132687181","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-21DOI: 10.1109/IESM.2015.7380333
Mohammed Hichame Benbitour, E. Sahin, A. Barbieri
Cross-docking is a logistics strategy used to accelerate the flows and to reduce inventory levels. In this paper, we consider the case of cross-docking centers applied in JIT manufacturing systems. We make a comparison between different cross-docking positioning policies: per supplier, per time slot, per mixed small/big time slots and per mixed supplier/time slot. We intend to shed light on the impact of different characteristics of the system like the supplier arrival frequency and the capacity of cross-docks on the performance of each cross-docking policy. The case study of Faurecia, an automotive parts suppliers, is used to consolidate the insights of our paper. We find that it is better to use the mixed cross-docking because it permits to minimize the used surface and to facilitate the realized movements.
{"title":"A comparison of different cross-docking organizations in a JIT manufacturing system; application in the automotive industry","authors":"Mohammed Hichame Benbitour, E. Sahin, A. Barbieri","doi":"10.1109/IESM.2015.7380333","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380333","url":null,"abstract":"Cross-docking is a logistics strategy used to accelerate the flows and to reduce inventory levels. In this paper, we consider the case of cross-docking centers applied in JIT manufacturing systems. We make a comparison between different cross-docking positioning policies: per supplier, per time slot, per mixed small/big time slots and per mixed supplier/time slot. We intend to shed light on the impact of different characteristics of the system like the supplier arrival frequency and the capacity of cross-docks on the performance of each cross-docking policy. The case study of Faurecia, an automotive parts suppliers, is used to consolidate the insights of our paper. We find that it is better to use the mixed cross-docking because it permits to minimize the used surface and to facilitate the realized movements.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131408471","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-21DOI: 10.1109/IESM.2015.7380259
Quentin Tonneau, Nathalie Bostel, P. Dejax, Romain Hospitalz, Valerie Mulhauptz, T. Yeung
This paper presents a new tactical optimization problem for non-hazardous waste and end-life product supply chain. Waste transport and recycling become crucial in our modern society, with a huge environmental and economic impact for industrials and communities. Operations on products during transport such as grinding or sorting allows companies to densify transports and reduce the overall supply cost. Integrating these new aspects, we introduce a new problem we term the multi-commodity, multi-flow problem with transformations and propose a linear mathematical model to solve it. With an application to a waste transport company and a performance benchmark on a linear solver, we show the pertinence of the model in a real case study and its scalability for more complex situations.
{"title":"Multimodal multi-flow problem with transformation : Application to waste supply chain","authors":"Quentin Tonneau, Nathalie Bostel, P. Dejax, Romain Hospitalz, Valerie Mulhauptz, T. Yeung","doi":"10.1109/IESM.2015.7380259","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380259","url":null,"abstract":"This paper presents a new tactical optimization problem for non-hazardous waste and end-life product supply chain. Waste transport and recycling become crucial in our modern society, with a huge environmental and economic impact for industrials and communities. Operations on products during transport such as grinding or sorting allows companies to densify transports and reduce the overall supply cost. Integrating these new aspects, we introduce a new problem we term the multi-commodity, multi-flow problem with transformations and propose a linear mathematical model to solve it. With an application to a waste transport company and a performance benchmark on a linear solver, we show the pertinence of the model in a real case study and its scalability for more complex situations.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127014497","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-21DOI: 10.1109/IESM.2015.7380287
Olga Battaia, X. Delorme, A. Dolgui, Grimaud Frederic, B. Finel
Flow lines are widely used in mechanical industry. They consist to a set of workstations through which parts are manufactured. Designing such a line is a very complex problem due to manufacturing and design constraints and to the large number of possible decisions. Usually, the design of this type of production lines involves the selection of the necessary operations (indivisible units of work) to machine a part, the configuration design, the line scheduling. In this paper we present a survey of flow lines balancing problem, their approach and formulation and some solutions to optimize them studied in the literature. A special attention is paid for the assembly lines balancing problems.
{"title":"Flow line balancing problem: A survey","authors":"Olga Battaia, X. Delorme, A. Dolgui, Grimaud Frederic, B. Finel","doi":"10.1109/IESM.2015.7380287","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380287","url":null,"abstract":"Flow lines are widely used in mechanical industry. They consist to a set of workstations through which parts are manufactured. Designing such a line is a very complex problem due to manufacturing and design constraints and to the large number of possible decisions. Usually, the design of this type of production lines involves the selection of the necessary operations (indivisible units of work) to machine a part, the configuration design, the line scheduling. In this paper we present a survey of flow lines balancing problem, their approach and formulation and some solutions to optimize them studied in the literature. A special attention is paid for the assembly lines balancing problems.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130678997","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-21DOI: 10.1109/IESM.2015.7380217
Renaud Allamano-Kessler, J. Morana, Jesús González-Feliu, H. Allaoui, L. Doyen
In this article, we propose a modeling of the triad composed of Manufacturers, Hyper Logistics Service Providers (HLSP), and Distributors. This modeling is based on the dynamics of the “Prey-Predator” populations. We focus the reflection on the LSP positioned as a keystone. We use a three-body “Lotka-Volterra” model with a logistic restriction for the Hyper-LSP. The aim of this model is to show that harmony is possible thanks to a third party. The model leads to a projection of the great and undeniable role of the HLSP. Could we see a logistic pattern of the future in this model? This article proves the assertion according to which the Hyper-LSP is a “keystone” in the relations of the distribution channel. The paper underlines the importance of the sustainability of the distribution channel.
{"title":"Stability around the hyper-LSP in French distribution channel: a “prey-predator” modeling","authors":"Renaud Allamano-Kessler, J. Morana, Jesús González-Feliu, H. Allaoui, L. Doyen","doi":"10.1109/IESM.2015.7380217","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380217","url":null,"abstract":"In this article, we propose a modeling of the triad composed of Manufacturers, Hyper Logistics Service Providers (HLSP), and Distributors. This modeling is based on the dynamics of the “Prey-Predator” populations. We focus the reflection on the LSP positioned as a keystone. We use a three-body “Lotka-Volterra” model with a logistic restriction for the Hyper-LSP. The aim of this model is to show that harmony is possible thanks to a third party. The model leads to a projection of the great and undeniable role of the HLSP. Could we see a logistic pattern of the future in this model? This article proves the assertion according to which the Hyper-LSP is a “keystone” in the relations of the distribution channel. The paper underlines the importance of the sustainability of the distribution channel.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"149 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115584356","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.7380234
E. Ben Alaia, I. Dridi, H. Bouchriha, P. Borne
The Pickup and Delivery Problems (PDP) represent an important class of Vehicle Routing Problems (VRP) in which goods must be collected and distributed. In this paper, we propose an approach which is based on the combination of Genetic Algorithm (GA) with the clustering algorithm for the optimization of multi-vehicles, multi-depots, pickup and delivery problem (m-MDPDP). The main contribution is to find new depot locations in order to obtain feasible solution (routes) for the m-MDPDPTW. These routes satisfy transportation requests without contravening any of the instance specific constraints.
{"title":"Insertion of new depot locations for the optimization of multi-vehicles multi-depots pickup and Delivery Problems using Genetic Algorithm","authors":"E. Ben Alaia, I. Dridi, H. Bouchriha, P. Borne","doi":"10.1109/IESM.2015.7380234","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380234","url":null,"abstract":"The Pickup and Delivery Problems (PDP) represent an important class of Vehicle Routing Problems (VRP) in which goods must be collected and distributed. In this paper, we propose an approach which is based on the combination of Genetic Algorithm (GA) with the clustering algorithm for the optimization of multi-vehicles, multi-depots, pickup and delivery problem (m-MDPDP). The main contribution is to find new depot locations in order to obtain feasible solution (routes) for the m-MDPDPTW. These routes satisfy transportation requests without contravening any of the instance specific constraints.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"9 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":"115616546","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.7380130
Zakaryae Boudi, E.M. El Koursi, S. Collart-Dutilleul
Reaching the critical software safety requirements is one of the most important and complex tasks for the safety-related industry. This fact explains, as it was highly recommended by the CENELEC standard, the increasing use of formal means in the development process. However, industrial environments are still reticent facing difficulties in incorporating those formal methods in a larger scale of application, especially because of their mathematical modeling complexity. The present paper proposes a Petri Nets-based approach for safety critical software development using a formal transformation into B abstract machines. This work presents formal definitions for the translation of Colored Petri Nets to B abstract machines. As part of the French research project called “PERFECT”, it aims at enabling a stronger combination of formal design techniques and analysis tools in order to cope with the real complexity of critical software development and to prove in an automated manner that the final software product satisfies all safety requirements. Therefore, the use of the B method will broaden the scope of its applicability by providing a new input modeling alternative. An illustrative application of the transformation practical use is shown in this paper for a railway level-crossing case study.
{"title":"Colored Petri Nets formal transformation to B machines for safety critical software development","authors":"Zakaryae Boudi, E.M. El Koursi, S. Collart-Dutilleul","doi":"10.1109/IESM.2015.7380130","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380130","url":null,"abstract":"Reaching the critical software safety requirements is one of the most important and complex tasks for the safety-related industry. This fact explains, as it was highly recommended by the CENELEC standard, the increasing use of formal means in the development process. However, industrial environments are still reticent facing difficulties in incorporating those formal methods in a larger scale of application, especially because of their mathematical modeling complexity. The present paper proposes a Petri Nets-based approach for safety critical software development using a formal transformation into B abstract machines. This work presents formal definitions for the translation of Colored Petri Nets to B abstract machines. As part of the French research project called “PERFECT”, it aims at enabling a stronger combination of formal design techniques and analysis tools in order to cope with the real complexity of critical software development and to prove in an automated manner that the final software product satisfies all safety requirements. Therefore, the use of the B method will broaden the scope of its applicability by providing a new input modeling alternative. An illustrative application of the transformation practical use is shown in this paper for a railway level-crossing case study.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"22 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":"125218747","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.7380203
Abdessamad Ait el cadi, R. Benmansour, Faiza Serraj, A. Artiba
We consider the problem of scheduling a set of jobs on a single machine subject to stochastic failures. The objective is to minimizing the makespan. The machine could be stopped for preventive maintenance occasionally to reduce the risk of failure and to improve its reliability. Furthermore, in the case of a breakdown, the machine undergoes a corrective maintenance which brings the age of the machine to zero (That is to say the machine is considered as good as new) and the current processed job is reprocessed from the beginning. Despite the fact that the scheduling problem with single or periodic maintenance has been well studied, most of the studies considered only deterministic cases. In other words the machine never fails. In this paper we take into account the stochastic failures while minimizing the makespan and determining the corresponding optimal sequence of jobs and optimal preventive maintenance policy. Both the exponential and the Weibull distribution are considered to model the probability density function associated with the lifetime of the machine. We use Arena and Optquest to optimize the performance criterion which allows us choosing the best sequence of jobs and the best amount of preventive maintenance.
{"title":"A joint optimization-simulation model to minimize the makespan on a repairable machine","authors":"Abdessamad Ait el cadi, R. Benmansour, Faiza Serraj, A. Artiba","doi":"10.1109/IESM.2015.7380203","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380203","url":null,"abstract":"We consider the problem of scheduling a set of jobs on a single machine subject to stochastic failures. The objective is to minimizing the makespan. The machine could be stopped for preventive maintenance occasionally to reduce the risk of failure and to improve its reliability. Furthermore, in the case of a breakdown, the machine undergoes a corrective maintenance which brings the age of the machine to zero (That is to say the machine is considered as good as new) and the current processed job is reprocessed from the beginning. Despite the fact that the scheduling problem with single or periodic maintenance has been well studied, most of the studies considered only deterministic cases. In other words the machine never fails. In this paper we take into account the stochastic failures while minimizing the makespan and determining the corresponding optimal sequence of jobs and optimal preventive maintenance policy. Both the exponential and the Weibull distribution are considered to model the probability density function associated with the lifetime of the machine. We use Arena and Optquest to optimize the performance criterion which allows us choosing the best sequence of jobs and the best amount of preventive maintenance.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"29 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":"127278787","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.7380146
K. Benkel, K. Jørnsten, R. Leisten
In this paper different aspects of variability in a job scheduling system are discussed. Unlike an ideal manufacturing system a real-world system requires an efficient mix of different buffers to balance the influence of variability. The focus in this paper is to observe the effects of non-uniformity of processing times on the performance measures Makespan, Flowtime and Squared Variability of Completion Time Differences (=CTDVB2). In addition, the behavior of Waiting Time and Idle Time regarding these measures is analyzed. An example is used to illustrate the influence of variability: A nonuniform permutation flow shop is smoothed in different ways. First a linear stepby- step harmonization is executed. Furthermore, non-uniform processing times are modified with a logarithmic and a quadratic optimization model.
{"title":"Variability aspects in flowshop scheduling systems","authors":"K. Benkel, K. Jørnsten, R. Leisten","doi":"10.1109/IESM.2015.7380146","DOIUrl":"https://doi.org/10.1109/IESM.2015.7380146","url":null,"abstract":"In this paper different aspects of variability in a job scheduling system are discussed. Unlike an ideal manufacturing system a real-world system requires an efficient mix of different buffers to balance the influence of variability. The focus in this paper is to observe the effects of non-uniformity of processing times on the performance measures Makespan, Flowtime and Squared Variability of Completion Time Differences (=CTDVB2). In addition, the behavior of Waiting Time and Idle Time regarding these measures is analyzed. An example is used to illustrate the influence of variability: A nonuniform permutation flow shop is smoothed in different ways. First a linear stepby- step harmonization is executed. Furthermore, non-uniform processing times are modified with a logarithmic and a quadratic optimization model.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"14 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":"125578541","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
扫码关注我们
求助内容：
应助结果提醒方式：