nach oben

Soft Computing

Erschienen in:

17.11.2021 | Application of soft computing

Flexible job shop scheduling problem considering machine and order acceptance, transportation costs, and setup times

verfasst von: Mohsen Ziaee, Javad Mortazavi, Mohsen Amra

Erschienen in: Soft Computing | Ausgabe 7/2022

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

This paper, for the first time, studied a new extension of the flexible job shop scheduling problem by assuming the acceptance and rejection of machines and orders. The flexible job shop problem was extended to implement production without a factory in natural environments. Therefore, the mixed-integer linear programming (MILP) model was developed for this problem aiming to minimize total costs, including the fixed cost of machine selection, variable operational cost, transportation cost, and order rejection cost. Due to the high complexity of this problem, a heuristic algorithm was employed to find an acceptable solution. For algorithm performance evaluation, 40 samples were randomly generated and solved using the mathematical model and the proposed algorithm. The results of analyzing random samples showed a negligible error rate indicating algorithm efficiency.

Vorheriger Artikel Using Bayesian optimization algorithm for model-based integration testing

Nächster Artikel A framework to predict the load-settlement behavior of shallow foundations in a range of soils from silty clays to sands using CPT records

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren

Ahmadi-Javid A, Hooshangi-Tabrizi P (2017) Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: A mathematical formulation and an Anarchic Society Optimization algorithm. Computers Oper Res 84:73–91MathSciNetCrossRef

Alidaee B, Li H (2014) Parallel machine selection and job scheduling to minimize sum of machine holding cost, total machine time costs, and total tardiness costs. IEEE Transactions Automation Sci Eng 11(1):294–301CrossRef

Bagheri A, Zandieh M (2011) Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—variable neighborhood search approach. J Manuf Syst 30(1):8–15CrossRef

Bagheri A, Zandieh M, Mahdavi I, Yazdani M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener Computer Syst 26(4):533–541CrossRef

Bartal Y, Leonardi S, Marchetti-Spaccamela A, Sgall J, Stougie L (2000) Multiprocessor scheduling with rejection. SIAM J Discrete Math 13(1):64–78MathSciNetCrossRef

Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41:157–183CrossRef

Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45(4):369–375MathSciNetCrossRef

Cao D, Chen M, Wan G (2005) Parallel machine selection and job scheduling to minimize machine cost and job tardiness. Computers Oper Res 32(8):1995–2012CrossRef

Dauzère-Pérès S, Paulli J (1997) An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Ann Oper Res 70:281–306MathSciNetCrossRef

Demir Y, İşleyen SK (2013) Evaluation of mathematical models for flexible job-shop scheduling problems. Appl Math Model 37(3):977–988MathSciNetCrossRef

Fanjul-Peyro L, Ruiz R (2010) Iterated greedy local search methods for unrelated parallel machine scheduling. Eur J Oper Res 207(1):55–69MathSciNetCrossRef

Fanjul-Peyro L, Ruiz R (2012) Scheduling unrelated parallel machines with optional machines and jobs selection. Computers Oper Res 39(7):1745–1753MathSciNetCrossRef

Fattahi P, Mehrabad MS, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18(3):331CrossRef

Finke G, Lemaire P, Proth J, Queyranne M (2009) Minimizing the number of machines for minimum length schedules. Eur J Oper Res 199(3):702–705MathSciNetCrossRef

Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117–129MathSciNetCrossRef

Karimi S, Ardalan Z, Naderi B, Mohammadi M (2017) Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm. Appl Math Model 41:667–682MathSciNetCrossRef

Kravchenko SA, Werner F (2009) Minimizing the number of machines for scheduling jobs with equal processing times. Eur J Oper Res 199(2):595–600MathSciNetCrossRef

Mati Y, Xie X (2004) The complexity of two-job shop problems with multi-purpose unrelated machines. Eur J Oper Res 152(1):159–169MathSciNetCrossRef

Naderi B, Zandieh M, Balagh AKG, Roshanaei V (2009) An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Syst Appl 36(6):9625–9633CrossRef

Naderi B, Javid AA, Jolai F (2010) Permutation flowshops with transportation times: mathematical models and solution methods. Int J Adv Manuf Technol 46(5–8):631–647CrossRef

Noroozi A, Mazdeh MM, Heydari M, Rasti-Barzoki M (2018) Coordinating order acceptance and integrated production-distribution scheduling with batch delivery considering third Party Logistics distribution. J Manuf Syst 46:29–45CrossRef

Oguz C, Salman FS, Yalçın ZB (2010) Order acceptance and scheduling decisions in make-to-order systems. Int J Prod Econ 125(1):200–211CrossRef

Rahman HF, Sarker R, Essam D (2015) A real-time order acceptance and scheduling approach for permutation flow shop problems. Eur J Oper Res 247(2):488–503MathSciNetCrossRef

Roshanaei V, Naderi B, Jolai F, Khalili M (2009) A variable neighborhood search for job shop scheduling with setup times to minimize makespan. Future Gener Computer Syst 25(6):654–661CrossRef

Roshanaei V, Azab A, ElMaraghy H (2013) Mathematical modelling and a meta-heuristic for flexible job shop scheduling. Int J Prod Res 51(20):6247–6274CrossRef

Ruiz-Torres AJ, Ho JC, López FJ (2006) Generating Pareto schedules with outsource and internal parallel resources. Int J Prod Econ 103(2):810–825CrossRef

Ruiz-Torres AJ, López FJ, Wojciechowski P, Ho JC (2010) Parallel machine scheduling problems considering regular measures of performance and machine cost. J Oper Res Soc 61(5):849–857CrossRef

Saidi-Mehrabad M, Fattahi P (2007) Flexible job shop scheduling with tabu search algorithms. Int J Adv Manuf Technol 32(5):563–570CrossRef

Strusevich VA (1999) A heuristic for the two-machine open-shop scheduling problem with transportation times. Discrete Appl Math 93(2–3):287–304MathSciNetCrossRef

Wagner HM (1959) An integer linear-programming model for machine scheduling. Naval Res Logist Q 6(2):131–140MathSciNetCrossRef

Zhang G, Shao X, Li P, Gao L (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Computers Indus Eng 56(4):1309–1318CrossRef

Titel: Flexible job shop scheduling problem considering machine and order acceptance, transportation costs, and setup times
verfasst von: Mohsen Ziaee
Javad Mortazavi
Mohsen Amra
Publikationsdatum: 17.11.2021
Verlag: Springer Berlin Heidelberg
Erschienen in: Soft Computing / Ausgabe 7/2022
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI: https://doi.org/10.1007/s00500-021-06481-y

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Weitere Artikel der Ausgabe 7/2022

Boosting denoisers with reinforcement learning for image restoration

A heuristic approach for multiple instance learning by linear separation

Representing uncertainty in group decision making through the hesitant information set approach

Prediction of machinability parameters in turning operation using interval type-2 fuzzy logic system based on semi-elliptic and trapezoidal membership functions

An improved weighted sum-fuzzy Dijkstra’s algorithm for shortest path problem (iWSFDA)

Use of optimal control in studying the dynamical behaviors of fractional financial awareness models

Premium Partner