Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Mehmet Mutlu Yenisey"'
Publikováno v:
2022 7th International Conference on Computer Science and Engineering (UBMK).
© 2022 IEEE.Prediction of the time that will be spent on IT support tickets is very important for planning and optimization of IT support services that are usually bound with service level agreements. Predicting completion time of a ticket is a diff
Autor:
Mehmet Mutlu Yenisey, Mustafa Yildirim
Publikováno v:
International Journal of Data Science. 6:129
Supply chain optimisation has been the subject of many scientific studies due to its mathematical structure. In this study, some optimisation studies that consider the components of the supply chai...
Autor:
Mehmet Mutlu Yenisey, Betul Yagmahan
Publikováno v:
Omega. 45:119-135
The flow shop scheduling problem is finding a sequence given n jobs with same order at m machines according to certain performance measure(s). The job can be processed on at most one machine; meanwhile one machine can process at most one job. The mos
Autor:
Mehmet Mutlu Yenisey, Betul Yagmahan
Publikováno v:
Expert Systems with Applications. 37:1361-1368
In this paper, we consider the flow shop scheduling problem with respect to the both objectives of makespan and total flowtime. This problem is known to be NP-hard type in literature. Several algorithms have been proposed to solve this problem. We pr
Publikováno v:
Behaviour & Information Technology. 24:259-274
Perceived security is defined as the level of security that users feel while they are shopping on e-commerce sites. The aims of this study were to determine items that positively influence this feeling of security by users during shopping, and to dev
Publikováno v:
Behaviour & Information Technology. 21:373-385
With internationalization of commerce and business and with increased use of e-business and e-commerce, it is important to ensure that these systems can be effectively utilized across cultural boundaries. To increase effectiveness, appropriate change
Autor:
Cagatay Iris, Mehmet Mutlu Yenisey
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642335860
ICCL
ICCL
This paper addresses simultaneous capacitated lot sizing and storage allocation in a multi-item manufacturing environment. The Capacitated Lot Sizing Problem (CLSP) is a very crucial tactical level decision making problem resulting in production amou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5abca3c2f61aba8273a89749e6f4ee7a
https://doi.org/10.1007/978-3-642-33587-7_10
https://doi.org/10.1007/978-3-642-33587-7_10
Autor:
Mehmet Mutlu Yenisey, Cagatay Iris
Publikováno v:
IFIP Advances in Information and Communication Technology
International Conference on Advances in Production Management Systems (APMS)
International Conference on Advances in Production Management Systems (APMS), Sep 2011, Stavanger, Norway. pp.107-114, ⟨10.1007/978-3-642-33980-6_13⟩
Advances in Production Management Systems. Value Networks: Innovation, Technologies, and Management ISBN: 9783642339790
APMS
International Conference on Advances in Production Management Systems (APMS)
International Conference on Advances in Production Management Systems (APMS), Sep 2011, Stavanger, Norway. pp.107-114, ⟨10.1007/978-3-642-33980-6_13⟩
Advances in Production Management Systems. Value Networks: Innovation, Technologies, and Management ISBN: 9783642339790
APMS
Part 1: Production Process; International audience; Capacitated Lot Sizing Problem is a very important tactical level decision making problem that answers the questions of producing when and how many in dynamic demand environment. Solving Capacitated
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::483b67a3f9226c8e587a220924cd2649
https://hal.inria.fr/hal-01524193/document
https://hal.inria.fr/hal-01524193/document
Autor:
Mehmet Mutlu Yenisey, Betul Yagmahan
Publikováno v:
Computational Intelligence in Flow Shop and Job Shop Scheduling ISBN: 9783642028359
Each plant and/or service provider performs several tasks to satisfy customer demand. Every task consumes several resources in order to be completed. Scheduling deals with the allocation of limited resources to tasks over time. Because the resources
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09ba32db04febe25843946003aedd526
https://doi.org/10.1007/978-3-642-02836-6_9
https://doi.org/10.1007/978-3-642-02836-6_9
Autor:
Mehmet Mutlu Yenisey, Betul Yagmahan
Flow shop scheduling problem consists of scheduling given jobs with same order at all machines. The job can be processed on at most one machine; meanwhile one machine can process at most one job. The most common objective for this problem is makespan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5ba5a6db464ae7304c4a0a6ee408788
http://hdl.handle.net/11452/22517
http://hdl.handle.net/11452/22517