Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Ya-Chih Tsai"'
Publikováno v:
IEEE Access, Vol 11, Pp 41368-41386 (2023)
This paper considers the hybrid flow shop scheduling problem, where jobs are processed in $m$ stages with the same route of the stage. Each stage has identical parallel machines for processing jobs. Some mathematical programming formulations and lowe
Externí odkaz:
https://doaj.org/article/239fce417bea492abde9a6da6b7eec94
Publikováno v:
IEEE Access, Vol 10, Pp 45444-45456 (2022)
The single-machine scheduling problem with a weight-modifying-activity (WMA) to minimize the total weighted completion time was initially addressed by Mosheiov and Oron in 2020, where the activity was an option, and once the activity was performed, t
Externí odkaz:
https://doaj.org/article/c42dbed2dfc04cc787dba4e45c6e0c6e
Publikováno v:
Algorithms, Vol 16, Iss 4, p 207 (2023)
This paper considers the single-machine problem with job release times and flexible preventive maintenance activities to minimize total weighted tardiness, a complicated scheduling problem for which many algorithms have been proposed in the literatur
Externí odkaz:
https://doaj.org/article/1ff42dba0be0443789864f8687cb793d
Publikováno v:
IEEE Access, Vol 9, Pp 139089-139108 (2021)
This paper considers an unrelated parallel machine problem with job release times and maintenance activities, in which machines have to periodically undergo maintenance since the status of the machines will be deteriorated by job-induced dirt. The pr
Externí odkaz:
https://doaj.org/article/cd63d4bc9ee64a6b950fa5b96cb31cdb
Publikováno v:
IEEE Access, Vol 7, Pp 22290-22300 (2019)
This paper studies a single-machine scheduling problem observed in the wafer manufacturing process, where the machine must receive periodical maintenance so that the dirt generated in the process does not exceed the limit. The objective is to minimiz
Externí odkaz:
https://doaj.org/article/66fab67f047b400396a4390e2d768783
Publikováno v:
IEEE Access, Vol 7, Pp 122164-122182 (2019)
This paper investigates the NP-hard problem of scheduling $n$ jobs on a single machine, where the machine must be stopped periodically for maintenance after a certain continuous working time. The objective is to minimize the total weighted completion
Externí odkaz:
https://doaj.org/article/fe221e61909d4bbba51be3ed289a9383
Autor:
Ya-chih Tsai, 蔡亞芝
104
This study aims to investigate the current situation of Taitung junior high school directors' leadership behaviors towards organizational justice, organization climate, and morale. Moreover, whether it can be influenced by teachers of differ
This study aims to investigate the current situation of Taitung junior high school directors' leadership behaviors towards organizational justice, organization climate, and morale. Moreover, whether it can be influenced by teachers of differ
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/25320712342405515242
Publikováno v:
Mathematical Problems in Engineering, Vol 2020 (2020)
This paper addresses a single-machine scheduling problem with periodic preventive maintenance activities that are predeterministic so that the machine is not available all the time, and jobs have to be processed between two consecutive maintenance pe
Publikováno v:
IEEE Access, Vol 7, Pp 22290-22300 (2019)
This paper studies a single-machine scheduling problem observed in the wafer manufacturing process, where the machine must receive periodical maintenance so that the dirt generated in the process does not exceed the limit. The objective is to minimiz
Publikováno v:
Communications in Computer and Information Science ISBN: 9789811555763
Motivated by the clean operation in the semiconductor manufacturing, this paper model it as a non-identical parallel machine scheduling problem with machine flexible periodical maintenance, in which the machines must to be stopped for changing cleani
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82d348905e39dadaf1b9b9544c6e269d
https://doi.org/10.1007/978-981-15-5577-0_38
https://doi.org/10.1007/978-981-15-5577-0_38