Show simple item record

dc.creatorOrtiz Suarez, Miguel Angel
dc.creatorBetancourt Ferrer, Leidy Esperanza
dc.creatorParra Negrete, Kevin Armando
dc.creatorDe Felice, Fabio
dc.creatorPetrillo, Antonella
dc.date.accessioned2018-11-20T01:36:23Z
dc.date.available2018-11-20T01:36:23Z
dc.date.issued2018-05-01
dc.identifier.issn02545330
dc.identifier.urihttp://hdl.handle.net/11323/1383
dc.description.abstractIn today highly competitive and globalized markets, an efficient use of production resources is necessary for manufacturing enterprises. In this research, the problem of scheduling and sequencing of manufacturing system is presented. A flexible job shop problem sequencing problem is analyzed in detail. After formulating this problem mathematically, a new model is proposed. This problem is not only theoretically interesting, but also practically relevant. An illustrative example is also conducted to demonstrate the applicability of the proposed model.spa
dc.language.isoengeng
dc.publisherAnnals Of Operations Researcheng
dc.rightsAtribución – No comercial – Compartir igualeng
dc.subjectFlexible Job-Shop Systemeng
dc.subjectOptimizationeng
dc.subjectReconfigurable Systemeng
dc.subjectSequencing Problemeng
dc.titleDispatching algorithm for production programming of flexible job-shop systems in the smart factory industryeng
dc.typeArticleeng
dcterms.references430 Alvarez-Valdes, R., Fuertes, A., Tamarit, J. M., Giménez, G., & Ramos, R. (2005). A heuristic to schedule 431 flexible job-shop in a glass factory. European Journal of Operational Research, 165(2005), 525–534. 432 Baker, K. R. (2005). Elements of sequencing and scheduling. Hanover, NH: Tuck School of Business. 433 Barrios, M. A. O., Caballero, J. E., & Sánchez, F. S. (2015). A methodology for the creation of integrated service 434 networks in outpatient internal medicine. In Ambient intelligence for health (pp. 247–257). Springer. 435 Bozek, A., & Wysocki, M. (2015). Flexible job shop with continuous material flow. International Journal of 436 Production Research, 53(4), 1273–1290. 437 Brandimarte, P. (1993). Routing and scheduling in a flexible job shop by Tabu search. Annals of Operations 438 Research, 41(3), 157–183. 439 Calleja, G., & Pastor, R. (2014). A dispatching algorithm for flexible job-shop scheduling with transfer batches: 440 An industrial application. Production Planning & Control, 25(2), 93–109. 441 De Felice, F., & Petrillo, A. (2013). Simulation approach for the optimization of the layout in a manufacturing 442 firm. 24th IASTED international conference on modelling and simulation, MS 2013; Banff, AB; Canada; 443 17 July 2013 through 19 July 2013 (pp. 152–161). 444 Demir, Y., & I¸sleyen, S. K. (2014). An effective genetic algorithm for flexible job-shop scheduling with 445 overlapping in operations. International Journal of Production Research, 52(13), 3905–3921. 446 Digiesi, S., Mossa, G., & Mummolo, G. (2013). A sustainable order quantity model under uncertain product 447 demand. 7th IFAC conference on manufacturing modelling, management, and control, MIM 2013 (pp. 448 664–669). Saint Petersburg; Russian Federation; 19 June–21 June. 449 Fattahi, F., & Fallahi, A. (2010). Dynamic scheduling in flexible job shop systems by considering simultane450 ously efficiency and stability. CIRP Journal of Manufacturing Science and Technology, 2, 114–123. 451 Fattahi, P., Hosseini, S. M. H., Jolai, F., & Tavakkoli-Moghaddam, R. (2014). A branch and bound algorithm 452 for hybrid flow shop scheduling problem with setup time and assembly operations. Applied Mathematical 453 Modelling, 38, 119–134. 454 Gholami, O., & Sotskov, Y. N. (2014). Solving parallel machines job-shop scheduling problems by an adaptive 455 algorithm. International Journal of Production Research, 52(13), 3888–3904. 456 Guo, W. J. (2006). Algorithms for two-stage flexible flow shop scheduling with fuzzy processing times. NanJing: 457 NanJing University of Science & Technology. 458 Hassin, R., & Shani, M. (2005). Machine scheduling with earliness, tardiness and nonexecution penalties. 459 Computers & Operations Research, 32, 683–705. 460 Herazo-Padilla, N., Montoya-Torres, J. R., Isaza, S. N., & Alvarado-Valencia, J. (2015). Simulation461 optimization approach for the stochastic location-routing problem. Journal of Simulation, 9(4), 296–311. 462 Hildebrandt, T., Heger, J., & Scholz-Reiter, B. (2010). Towards improved dispatching rules for complex shop 463 floor scenarios—A genetic programming approach. GECCO’10, July 7–11, 2010. Portland, Oregon, 464 USA. 465 Hu, H. (2015). Adaptive scheduling model in hybrid flowshop production control using petri net. International 466 Journal of Control and Automation, 8(1), 233–242. 467 Jansen K, Mastrolilli M, & Solis-Oba R, (2000). Approximation algorithms for Flexible Job Shop Problems. 468 In: Lecture notes in computer science, Vol. 1776. Proceedings of the fourth Latin American symposium 469 on theoretical informatics (pp. 68–77). Berlin: Springer. 470 Jungwattanakit, J., Reodecha, M., Chaovalitwongse, P., & Werner, F. (2009). A comparison of scheduling 471 algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual 472 criteria. Computers and Operations Research, 36(2), 358–378. 473 Kacem, I., Hammadi, S., & Borne, P. (2002). Pareto-optimality Approach for Flexible Job-shop Scheduling 474 Problems: Hybridization of Evolutionary Algorithms and Fuzzy Logic. Journal of Mathematics and 475 Computers in Simulation 476 Karimi-Nasab, M., & Modarres, M. (2015). Lot sizing and job shop scheduling with compressible process 477 times: A cut and branch approach. Computers & Industrial Engineering, 85, 196–205. 478 Kurz, M. E., & Askin, R. G. (2004). Scheduling flexible flow lines with sequence dependent setup times. 479 European Journal of Operational Research, 159(1), 66–82. 480 Logendran, R., Carson, S., & Hanson, E. (2005). Grouping scheduling in flexible flow shops. International 481 Journal of Production Economics, 96(2), 143–155. 482 Pezzella, F., Morganti, G., & Ciaschetti, G. (2008). A genetic algorithm for the Flexible Job-shop Scheduling 483 Problem. Computers & Operations Research, 35, 3202–3212. 484 Pinedo, M. (2001). Scheduling: Theory, algorithms, and systems. Upper Saddle River, NJ: Prentice Hall. 485 Prot, D., Bellenguez-Morineau, O., & Lahlou, C. (2013). New complexity results for parallel identical machine 486 scheduling problems with preemption, release dates and regular criteria. European Journal of Operational 487 Research, 231, 282–287. 488 Riane, F., Artiba, A., & Elmaghraby, S. E. (2002). Sequencing a hybrid two-stage flow shop with dedicated 489 machines. Int. J. Prod. Res., 40, 4353–4380. 490 Shen, X.-N., & Yao, X. (2015). Mathematical modeling and multi-objective evolutionary algorithms applied 491 to dynamic flexible job shop scheduling problems. Information Sciences, 298, 198–224. 492 Sotskov, Y. N., & Gholami, O. (2015). Mixed graph model and algorithms for parallel-machine job-shop 493 scheduling problems. International Journal of Production Research, 55(6), 1549–1564. 494 Sun, D.-H., He, W., Zheng, L.-J., & Liao, X.-Y. (2014). Scheduling flexible job shop problem subject to machine 495 breakdown with game theory. International Journal of Production Research, 52(13), 3858–3876. 496 Türkylmaz, A., & Bulkan, S. (2015). A hybrid algorithm for total tardiness minimization in flexible job shop: 497 Genetic algorithm with parallel VNS execution. International Journal of Production Research, 53(6), 498 1832–1848. 499 Wang, S., & Liu, M. (2013). A heuristic method for two-stage hybrid flow shop with dedicated machines. 500 Computers & Operations Research, 40, 438–450. 501 Yokoyama, M. (2004). Scheduling for two-stage production system with setup and assembly operations. 502 Computers & Operations Research, 31, 2063–2078.spa


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record