Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
The Methods and Approaches of Explainable Artificial Intelligence Read chapter Read first chapter

2021 | OriginalPaper | Chapter

The Problem of Tasks Scheduling with Due Dates in a Flexible Multi-machine Production Cell

Authors : Wojciech Bożejko, Piotr Nadybski, Paweł Rajba, Mieczysław Wodecki

Published in: Computational Science – ICCS 2021

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In the paper we consider an NP-hard problem of tasks scheduling with due dates and penalties for the delay in a flexible production cell. Each task should be assigned to one of the cell’s machines and the order of their execution on machines should be determined. The sum of penalties for tardiness of tasks execution should be minimized. We propose to use the tabu search algorithm to solve the problem. Neighborhoods are generated by moves based on changing the order of tasks on the machine and changing the machine on which the task will be performed. We prove properties of moves that significantly accelerate the search of the neighborhoods and shorten the time of the algorithm execution and in result significantly improves the efficiency of the algorithm compared to the version that does not use these properties.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Description of Electricity Consumption by Using Leading Hours Intra-day Model
next chapter Discovering the Influence of Interruptions in Cycling Training: A Data Science Study
Literature
1.
Alidaee, B., Rosa, D.: Scheduling parallel machines to minimize total weighted and unweighted tardiness. Comput. Oper. Res. 24(8), 775–788 (1997)MathSciNetCrossRef
2.
Bożejko, W., Grabowski, J., Wodecki, M.: Block approach tabu search algorithm for single machine total weighted tardiness problem. Comput. Ind. Eng. 50(1–2), 1–14 (2006)CrossRef
3.
Bożejko, W., Uchroński, M., Wodecki, M.: Blocks for two-machines total weighted tardiness flow shop scheduling problem. Bull. Pol. Acad. Sci. Tech. Sci. 68(1), 31–41 (2020)
4.
Bulfin, R.L., Hallah, R.: Minimizing the weighted number of tardy tasks on two-machine flow shop. Comput. Oper. Res. 30, 1887–1900 (2003)MathSciNetCrossRef
5.
Karabulut, K.: A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops. Comput. Ind. Eng. 98, 300–307 (2016)CrossRef
6.
Kayvanfar, V., Komaki, G.H.M., Aalaei, A., Zandieh, M.: Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times. Comput. Oper. Res. 41, 31–43 (2014)MathSciNetCrossRef
7.
Lenstra, J.K., Rinnooy Kan, A.G.H., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343–362 (1977)
8.
Liaw, C.-F., Lin, Y.-K., Cheng, C.-Y., Chen, M.: Scheduling unrelated parallel machines to minimize total weighted tardiness. Comput. Oper. Res. 30(12), 1777–1789 (2003)MathSciNetCrossRef
9.
Liu, C.: A hybrid genetic algorithm to minimize total tardiness for unrelated parallel machine scheduling with precedence constraints. Math. Probl. Eng. (2013). ID 537127
10.
Park, J.M., Choi, B.C., Min, Y., Kim, K.M.: Two-machine ordered flow shop scheduling with generalized due dates. Asia-Pac. J. Oper. Res. 37(01), 1950032 (2020)MathSciNetCrossRef
11.
Ojstersek, R., Tang, M., Buchmeister, B.: Due date optimization in multi-objective scheduling of flexible job shop production. Adv. Prod. Eng. Manag. 15(4), 481–492 (2020)
12.
Potts, C.N., Van Wassenhove, L.N.: A decomposition algorithm for the single machine total tardiness problem. Oper. Res. Lett. 1, 177–181 (1982)CrossRef
13.
Toncovicha, A., Rossit, D., Frutos, M., Rossit, D.G., Daniel, A.: Solving a multi-objective manufacturing cell scheduling problem with the consideration of warehouses using a simulated annealing based procedure. Int. J. Ind. Eng. Comput. 10, 1–16 (2019)
14.
Wodecki, M.: A block branch-and-bound parallel algorithm for single-machine total weighted tardiness problem. Adv. Manuf. Technol. 37, 996–1004 (2008)CrossRef
Metadata
Title
The Problem of Tasks Scheduling with Due Dates in a Flexible Multi-machine Production Cell
Authors
Wojciech Bożejko
Piotr Nadybski
Paweł Rajba
Mieczysław Wodecki
Copyright Year
2021
Book
Computational Science – ICCS 2021

Print ISBN: 978-3-030-77969-6

Electronic ISBN: 978-3-030-77970-2

Copyright Year: 2021

DOI
https://doi.org/10.1007/978-3-030-77970-2_31

Premium Partner

    Image Credits