[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

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

  • Original Paper
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

(Source: Scopus)

Fig. 2

(Source: Scopus)

Fig. 3

Source: Calleja and Pastor (2014)

Fig. 4

Source: Calleja and Pastor (2014)

Fig. 5

Source: Calleja and Pastor (2014)

Fig. 6

Source: Calleja and Pastor (2015)

Fig. 7
Fig. 8
Fig. 9

Source: Author

Fig. 10

Source: Author

Similar content being viewed by others

Abbreviations

n:

Number of pieces

m:

Number of machines

G(i):

Number of operations of the piece i (i = 1...n)

H(j):

Number of operations in the tail of the machine j (j = 1 ...m).

fj:

Instant the machine j is available for a new operation

pk,i,j:

Processing time of operation k of the item i in the machine j

rk,i:

Instant availability of operation (k, i)

Rpk,i,j:

(release date o ready date) Early instant to start the operation (k, i) on the machine j: \(\hbox {rpk,i,j }= \hbox {max }\{\hbox { rk,i, fj for all (k,i) }\upepsilon \hbox { Ej}\)

fpj:

Early instant to start a new operation on the machine j (if no queue, infinite value is assigned):

\(\hbox {fpj} = \hbox {min(k,i)}\upepsilon \hbox { Ej }\{\hbox { rpk,i,j }\}\) if Ej is not empty

\(\hbox {fpj} = \infty \) if Ej is empty

\(\hbox {t}_{\mathrm{start}}\) (k, i):

Manufacturing start time scheduled operation

[\(\hbox {t}_{\mathrm{start}}\)] \(\hbox {(k, i)} = \hbox {rpk,i, j}\)

\(\hbox {t}_{\mathrm{end}}\) (k, i):

Manufacturing final instant programmed operation

[\(\hbox {t}_{\mathrm{end}}\)] \(\hbox {(k, i)} = \hbox {tstart (k, i)} +\hbox { D }\cdot \hbox { pk,i,j}\)

References

  • Alvarez-Valdes, R., Fuertes, A., Tamarit, J. M., Giménez, G., & Ramos, R. (2005). A heuristic to schedule flexible job-shop in a glass factory. European Journal of Operational Research, 165(2005), 525–534.

    Article  Google Scholar 

  • Baker, K. R. (2005). Elements of sequencing and scheduling. Hanover, NH: Tuck School of Business.

    Google Scholar 

  • 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.

  • Bozek, A., & Wysocki, M. (2015). Flexible job shop with continuous material flow. International Journal of Production Research, 53(4), 1273–1290.

    Article  Google Scholar 

  • Brandimarte, P. (1993). Routing and scheduling in a flexible job shop by Tabu search. Annals of Operations Research, 41(3), 157–183.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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).

  • 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.

    Article  Google Scholar 

  • 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.

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Guo, W. J. (2006). Algorithms for two-stage flexible flow shop scheduling with fuzzy processing times. NanJing: NanJing University of Science & Technology.

    Google Scholar 

  • Hassin, R., & Shani, M. (2005). Machine scheduling with earliness, tardiness and nonexecution penalties. Computers & Operations Research, 32, 683–705.

    Article  Google Scholar 

  • Herazo-Padilla, N., Montoya-Torres, J. R., Isaza, S. N., & Alvarado-Valencia, J. (2015). Simulation-optimization approach for the stochastic location-routing problem. Journal of Simulation, 9(4), 296–311.

    Article  Google Scholar 

  • Hildebrandt, T., Heger, J., & Scholz-Reiter, B. (2010). Towards improved dispatching rules for complex shop floor scenarios—A genetic programming approach. GECCO’10, July 7–11, 2010. Portland, Oregon, USA.

  • Hu, H. (2015). Adaptive scheduling model in hybrid flowshop production control using petri net. International Journal of Control and Automation, 8(1), 233–242.

    Article  Google Scholar 

  • 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.

  • 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.

    Article  Google Scholar 

  • 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

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Logendran, R., Carson, S., & Hanson, E. (2005). Grouping scheduling in flexible flow shops. International Journal of Production Economics, 96(2), 143–155.

    Article  Google Scholar 

  • Pezzella, F., Morganti, G., & Ciaschetti, G. (2008). A genetic algorithm for the Flexible Job-shop Scheduling Problem. Computers & Operations Research, 35, 3202–3212.

    Article  Google Scholar 

  • Pinedo, M. (2001). Scheduling: Theory, algorithms, and systems. Upper Saddle River, NJ: Prentice Hall.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Wang, S., & Liu, M. (2013). A heuristic method for two-stage hybrid flow shop with dedicated machines. Computers & Operations Research, 40, 438–450.

    Article  Google Scholar 

  • Yokoyama, M. (2004). Scheduling for two-stage production system with setup and assembly operations. Computers & Operations Research, 31, 2063–2078.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Universidad de la Costa CUC, Barranquilla, Colombia

    Miguel A. Ortíz, Leidy E. Betancourt & Kevin Parra Negrete

  2. Department of Civil and Mechanical Engineering, University of Cassino and Southern Lazio, 03043, Cassino, Italy

    Fabio De Felice

  3. Department of Engineering, University of Naples “Parthenope”, 80143, Naples, Italy

    Antonella Petrillo

Authors
  1. Miguel A. Ortíz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leidy E. Betancourt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kevin Parra Negrete
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Fabio De Felice
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Antonella Petrillo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Antonella Petrillo.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ortíz, M.A., Betancourt, L.E., Negrete, K.P. et al. Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry. Ann Oper Res 264, 409–433 (2018). https://doi.org/10.1007/s10479-017-2678-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-017-2678-x

Keywords

Search

Navigation