메뉴 건너뛰기




Volumn 264, Issue 1-2, 2018, Pages 409-433

Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry

Author keywords

Flexible job shop system; Optimization; Reconfigurable system; Sequencing problem

Indexed keywords


EID: 85030712380     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-017-2678-x     Document Type: Article
Times cited : (25)

References (33)
  • 3
    • 84954151172 scopus 로고    scopus 로고
    • A methodology for the creation of integrated service networks in outpatient internal medicine
    • Springer
    • Barrios, M. A. O., Caballero, J. E., & Sánchez, F. S. (2015). A methodology for the creation of integrated service networks in outpatient internal medicine. In Ambient intelligence for health (pp. 247–257). Springer.
    • (2015) Ambient Intelligence for Health , pp. 247-257
    • Barrios, M.A.O.1    Caballero, J.E.2    Sánchez, F.S.3
  • 5
    • 34250084648 scopus 로고
    • Routing and scheduling in a flexible job shop by Tabu search
    • Brandimarte, P. (1993). Routing and scheduling in a flexible job shop by Tabu search. Annals of Operations Research, 41(3), 157–183.
    • (1993) Annals of Operations Research , vol.41 , Issue.3 , pp. 157-183
    • Brandimarte, P.1
  • 6
    • 84889808975 scopus 로고    scopus 로고
    • A dispatching algorithm for flexible job-shop scheduling with transfer batches: An industrial application
    • Calleja, G., & Pastor, R. (2014). A dispatching algorithm for flexible job-shop scheduling with transfer batches: An industrial application. Production Planning & Control, 25(2), 93–109.
    • (2014) Production Planning & Control , vol.25 , Issue.2 , pp. 93-109
    • Calleja, G.1    Pastor, R.2
  • 7
    • 84883565658 scopus 로고    scopus 로고
    • 24th IASTED international conference on modelling and simulation, MS 2013; Banff, AB; Canada; 17 July 2013 through 19 July 2013
    • De Felice, F., & Petrillo, A. (2013). Simulation approach for the optimization of the layout in a manufacturing firm. 24th IASTED international conference on modelling and simulation, MS 2013; Banff, AB; Canada; 17 July 2013 through 19 July 2013 (pp. 152–161).
    • (2013) Simulation Approach for the Optimization of the Layout in a Manufacturing Firm , pp. 152-161
    • de Felice, F.1    Petrillo, A.2
  • 8
    • 84902836669 scopus 로고    scopus 로고
    • An effective genetic algorithm for flexible job-shop scheduling with overlapping in operations
    • Demir, Y., & Işleyen, S. K. (2014). An effective genetic algorithm for flexible job-shop scheduling with overlapping in operations. International Journal of Production Research, 52(13), 3905–3921.
    • (2014) International Journal of Production Research , vol.52 , Issue.13 , pp. 3905-3921
    • Demir, Y.1    Işleyen, S.K.2
  • 9
    • 84884323631 scopus 로고    scopus 로고
    • A sustainable order quantity model under uncertain product demand
    • MIM, Saint Petersburg; Russian Federation; 19 June–21 June
    • Digiesi, S., Mossa, G., & Mummolo, G. (2013). A sustainable order quantity model under uncertain product demand. 7th IFAC conference on manufacturing modelling, management, and control, MIM 2013 (pp. 664–669). Saint Petersburg; Russian Federation; 19 June–21 June.
    • (2013) 7Th IFAC Conference on Manufacturing Modelling, Management, and Control , pp. 664-669
    • Digiesi, S.1    Mossa, G.2    Mummolo, G.3
  • 10
    • 77950629301 scopus 로고    scopus 로고
    • Dynamic scheduling in flexible job shop systems by considering simultaneously efficiency and stability
    • Fattahi, F., & Fallahi, A. (2010). Dynamic scheduling in flexible job shop systems by considering simultaneously efficiency and stability. CIRP Journal of Manufacturing Science and Technology, 2, 114–123.
    • (2010) CIRP Journal of Manufacturing Science and Technology , vol.2 , pp. 114-123
    • Fattahi, F.1    Fallahi, A.2
  • 11
    • 84887628019 scopus 로고    scopus 로고
    • A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
    • Fattahi, P., Hosseini, S. M. H., Jolai, F., & Tavakkoli-Moghaddam, R. (2014). A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations. Applied Mathematical Modelling, 38, 119–134.
    • (2014) Applied Mathematical Modelling , vol.38 , pp. 119-134
    • Fattahi, P.1    Hosseini, S.M.H.2    Jolai, F.3    Tavakkoli-Moghaddam, R.4
  • 12
    • 84902790536 scopus 로고    scopus 로고
    • Solving parallel machines job-shop scheduling problems by an adaptive algorithm
    • Gholami, O., & Sotskov, Y. N. (2014). Solving parallel machines job-shop scheduling problems by an adaptive algorithm. International Journal of Production Research, 52(13), 3888–3904.
    • (2014) International Journal of Production Research , vol.52 , Issue.13 , pp. 3888-3904
    • Gholami, O.1    Sotskov, Y.N.2
  • 14
    • 4744340577 scopus 로고    scopus 로고
    • Machine scheduling with earliness, tardiness and nonexecution penalties
    • Hassin, R., & Shani, M. (2005). Machine scheduling with earliness, tardiness and nonexecution penalties. Computers & Operations Research, 32, 683–705.
    • (2005) Computers & Operations Research , vol.32 , pp. 683-705
    • Hassin, R.1    Shani, M.2
  • 17
    • 85079333605 scopus 로고    scopus 로고
    • Adaptive scheduling model in hybrid flowshop production control using petri net
    • Hu, H. (2015). Adaptive scheduling model in hybrid flowshop production control using petri net. International Journal of Control and Automation, 8(1), 233–242.
    • (2015) International Journal of Control and Automation , vol.8 , Issue.1 , pp. 233-242
    • Hu, H.1
  • 18
    • 84896796755 scopus 로고    scopus 로고
    • Approximation algorithms for Flexible Job Shop Problems
    • Proceedings of the fourth Latin American symposium on theoretical informatics, Berlin, Springer
    • Jansen K, Mastrolilli M, & Solis-Oba R, (2000). Approximation algorithms for Flexible Job Shop Problems. In: Lecture notes in computer science, Vol. 1776. Proceedings of the fourth Latin American symposium on theoretical informatics (pp. 68–77). Berlin: Springer.
    • (2000) Lecture Notes in Computer Science , vol.1776 , pp. 68-77
    • Jansen, K.1    Mastrolilli, M.2    Solis-Oba, R.3
  • 19
    • 52049090864 scopus 로고    scopus 로고
    • A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
    • Jungwattanakit, J., Reodecha, M., Chaovalitwongse, P., & Werner, F. (2009). A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Computers and Operations Research, 36(2), 358–378.
    • (2009) Computers and Operations Research , vol.36 , Issue.2 , pp. 358-378
    • Jungwattanakit, J.1    Reodecha, M.2    Chaovalitwongse, P.3    Werner, F.4
  • 20
    • 0037201140 scopus 로고    scopus 로고
    • Pareto-optimality Approach for Flexible Job-shop Scheduling Problems: Hybridization of Evolutionary Algorithms and Fuzzy Logic
    • Kacem, I., Hammadi, S., & Borne, P. (2002). Pareto-optimality Approach for Flexible Job-shop Scheduling Problems: Hybridization of Evolutionary Algorithms and Fuzzy Logic. Journal of Mathematics and Computers in Simulation
    • (2002) Journal of Mathematics and Computers in Simulation
    • Kacem, I.1    Hammadi, S.2    Borne, P.3
  • 21
    • 84927128098 scopus 로고    scopus 로고
    • Lot sizing and job shop scheduling with compressible process times: A cut and branch approach
    • Karimi-Nasab, M., & Modarres, M. (2015). Lot sizing and job shop scheduling with compressible process times: A cut and branch approach. Computers & Industrial Engineering, 85, 196–205.
    • (2015) Computers & Industrial Engineering , vol.85 , pp. 196-205
    • Karimi-Nasab, M.1    Modarres, M.2
  • 22
    • 2942674864 scopus 로고    scopus 로고
    • Scheduling flexible flow lines with sequence dependent setup times
    • Kurz, M. E., & Askin, R. G. (2004). Scheduling flexible flow lines with sequence dependent setup times. European Journal of Operational Research, 159(1), 66–82.
    • (2004) European Journal of Operational Research , vol.159 , Issue.1 , pp. 66-82
    • Kurz, M.E.1    Askin, R.G.2
  • 24
    • 40249118429 scopus 로고    scopus 로고
    • A genetic algorithm for the Flexible Job-shop Scheduling Problem
    • Pezzella, F., Morganti, G., & Ciaschetti, G. (2008). A genetic algorithm for the Flexible Job-shop Scheduling Problem. Computers & Operations Research, 35, 3202–3212.
    • (2008) Computers & Operations Research , vol.35 , pp. 3202-3212
    • Pezzella, F.1    Morganti, G.2    Ciaschetti, G.3
  • 26
    • 84880571440 scopus 로고    scopus 로고
    • New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
    • Prot, D., Bellenguez-Morineau, O., & Lahlou, C. (2013). New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria. European Journal of Operational Research, 231, 282–287.
    • (2013) European Journal of Operational Research , vol.231 , pp. 282-287
    • Prot, D.1    Bellenguez-Morineau, O.2    Lahlou, C.3
  • 27
    • 0037146413 scopus 로고    scopus 로고
    • Sequencing a hybrid two-stage flow shop with dedicated machines
    • Riane, F., Artiba, A., & Elmaghraby, S. E. (2002). Sequencing a hybrid two-stage flow shop with dedicated machines. Int. J. Prod. Res., 40, 4353–4380.
    • (2002) Int. J. Prod. Res. , vol.40 , pp. 4353-4380
    • Riane, F.1    Artiba, A.2    Elmaghraby, S.E.3
  • 28
    • 84922454987 scopus 로고    scopus 로고
    • Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems
    • Shen, X.-N., & Yao, X. (2015). Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems. Information Sciences, 298, 198–224.
    • (2015) Information Sciences , vol.298 , pp. 198-224
    • Shen, X.-N.1    Yao, X.2
  • 29
    • 84939825742 scopus 로고    scopus 로고
    • Mixed graph model and algorithms for parallel-machine job-shop scheduling problems
    • Sotskov, Y. N., & Gholami, O. (2015). Mixed graph model and algorithms for parallel-machine job-shop scheduling problems. International Journal of Production Research, 55(6), 1549–1564.
    • (2015) International Journal of Production Research , vol.55 , Issue.6 , pp. 1549-1564
    • Sotskov, Y.N.1    Gholami, O.2
  • 30
    • 84902793346 scopus 로고    scopus 로고
    • Scheduling flexible job shop problem subject to machine breakdown with game theory
    • Sun, D.-H., He, W., Zheng, L.-J., & Liao, X.-Y. (2014). Scheduling flexible job shop problem subject to machine breakdown with game theory. International Journal of Production Research, 52(13), 3858–3876.
    • (2014) International Journal of Production Research , vol.52 , Issue.13 , pp. 3858-3876
    • Sun, D.-H.1    He, W.2    Zheng, L.-J.3    Liao, X.-Y.4
  • 31
    • 84922269332 scopus 로고    scopus 로고
    • A hybrid algorithm for total tardiness minimization in flexible job shop: Genetic algorithm with parallel VNS execution
    • Türkylmaz, A., & Bulkan, S. (2015). A hybrid algorithm for total tardiness minimization in flexible job shop: Genetic algorithm with parallel VNS execution. International Journal of Production Research, 53(6), 1832–1848.
    • (2015) International Journal of Production Research , vol.53 , Issue.6 , pp. 1832-1848
    • Türkylmaz, A.1    Bulkan, S.2
  • 32
    • 84866166210 scopus 로고    scopus 로고
    • A heuristic method for two-stage hybrid flow shop with dedicated machines
    • Wang, S., & Liu, M. (2013). A heuristic method for two-stage hybrid flow shop with dedicated machines. Computers & Operations Research, 40, 438–450.
    • (2013) Computers & Operations Research , vol.40 , pp. 438-450
    • Wang, S.1    Liu, M.2
  • 33
    • 2642555389 scopus 로고    scopus 로고
    • Scheduling for two-stage production system with setup and assembly operations
    • Yokoyama, M. (2004). Scheduling for two-stage production system with setup and assembly operations. Computers & Operations Research, 31, 2063–2078.
    • (2004) Computers & Operations Research , vol.31 , pp. 2063-2078
    • Yokoyama, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.