Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Muberra Allahverdi"'
Publikováno v:
International Journal of Industrial Engineering Computations, Vol 13, Iss 4, Pp 543-556 (2022)
We address a manufacturing environment with the no-wait constraint which is common in industries such as metal, plastic, and semiconductor. Setup times are modelled as uncertain with the objective of minimizing maximum lateness which is an important
Externí odkaz:
https://doaj.org/article/a080e3bbacf84075bfaa3047d7b196a3
Autor:
Muberra Allahverdi
Publikováno v:
Journal of Project Management, Vol 7, Iss 1, Pp 1-12 (2022)
Since scheduling literature has a wide range of uncertainties, it is crucial to take these into account when solving performance measure problems. Otherwise, the performance may severely be affected in a negative way. In this paper, an algorithm is p
Externí odkaz:
https://doaj.org/article/14134a2d8dd24406827456d932db74cb
Autor:
Muberra ALLAHVERDİ
Publikováno v:
Hacettepe Journal of Mathematics and Statistics
The problem of minimizing total completion time (TCT) in an uncertain environment is a crucial problem in production engineering. Minimizing the TCT of a two-machine no-wait scheduling problem with uncertain and bounded setup times is known to be ver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::98a3bbd5028b0d0b49739ce05686a01c
https://doi.org/10.15672/hujms.831074
https://doi.org/10.15672/hujms.831074
Autor:
Muberra Allahverdi
Publikováno v:
RAIRO - Operations Research.
The two-machine flowshop scheduling problem with the performance measure of total tardiness is addressed. This performance measure is essential since meeting deadlines is a crucial part of scheduling and a major concern for some manufacturing systems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a4a8a2a489cae5afde499f67977bdf1
https://doi.org/10.1051/ro/2023023
https://doi.org/10.1051/ro/2023023
Publikováno v:
Volume: 13, Issue: 2 521-530
International Journal of Engineering Research and Development
International Journal of Engineering Research and Development
We address the four-machine flowshop scheduling problem with the objective of minimizing makespan with uncertain processing times The problem was addressed in the literature (RAIRO Operations Research 54, 529-553) and different algorithms were propos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::75c24afc20d759edbf6396570a140392
https://doi.org/10.29137/umagd.887624
https://doi.org/10.29137/umagd.887624
Autor:
Ali Allahverdi, Muberra Allahverdi
Publikováno v:
RAIRO - Operations Research. 55:S929-S946
The four-machine flowshop scheduling problem is investigated with the objective of minimizing total completion time. Job processing times are uncertain where only the lower and upper bounds are known. This problem is common in some manufacturing envi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6beeff49902694fd51f4c133c61c3ab5
https://doi.org/10.1051/ro/2020022
https://doi.org/10.1051/ro/2020022
Autor:
Muberra Allahverdi, Ali Allahverdi
Publikováno v:
RAIRO - Operations Research. 54:529-553
We consider the four-machine flowshop scheduling problem to minimize makespan where processing times are uncertain. The processing times are within some intervals, where the only available information is the lower and upper bounds of job processing t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d60d62e639a76d92d9ffd8b07526950f
https://doi.org/10.1051/ro/2020010
https://doi.org/10.1051/ro/2020010
Publikováno v:
Journal of Industrial & Management Optimization. 16:2439-2457
We address a two-machine no-wait flowshop scheduling problem with respect to the performance measure of total completion time. Minimizing total completion time is important when inventory cost is of concern. Setup times are treated separately from pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e23b64dfd4a831c61e79bc487ae95682
https://doi.org/10.3934/jimo.2019062
https://doi.org/10.3934/jimo.2019062
Publikováno v:
Journal of Algebra. 535:133-158
Let R be a Noetherian commutative ring and M a R-module with pd R M ≤ 1 that has rank. Necessary and sufficient conditions were provided in [1] for an exterior power ∧ k M to be torsion free. When M is an ideal of R similar necessary and sufficie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d4b684caf455df3d3af5dfb0b7666e4c
https://doi.org/10.1016/j.jalgebra.2019.05.035
https://doi.org/10.1016/j.jalgebra.2019.05.035
Autor:
Muberra Allahverdi, Ali Allahverdi
Publikováno v:
Computational and Applied Mathematics. 37:6774-6794
We consider the two-machine no-wait flowshop scheduling problem to minimize maximum lateness, where setup times are considered separate from processing times. Moreover, setup times are uncertain (within some intervals), where only lower and upper bou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0caa58b541dce461b937146e26df9f96
https://doi.org/10.1007/s40314-018-0694-3
https://doi.org/10.1007/s40314-018-0694-3