Výsledky vyhledávání - "Shang Chia Liu"

Akademický článek

A Two-Stage Three-Machine Flow Shop Assembly Problem Mixed with a Controllable Number and Sum-of-Processing Times-Based Learning Effect by Simulated Annealing Algorithms

Autor: Shang-Chia Liu

Publikováno v: Discrete Dynamics in Nature and Society, Vol 2020 (2020)

The two-stage assembly scheduling problem is widely used in industrial and service industries. This study focuses on the two-stage three-machine flow shop assembly problem mixed with a controllable number and sum-of-processing times-based learning ef

Externí odkaz: https://doaj.org/article/759066e7ac414ee081f4fd07396182b5

Zobrazit plný text záznamu

Plný text ve formátu HTML

A two-stage three-machine assembly scheduling problem with a truncation position-based learning effect

Autor: Win-Chin Lin, Shang-Chia Liu, Po-An Pan, Lamjed Ben Said, Ameni Azzouz, Peng-Hsiang Hsu, Chin-Chia Wu

Publikováno v: Soft Computing. 24:10515-10533

The two-stage assembly scheduling problem has a lot of applications in industrial and service sectors. Furthermore, truncation-based learning effects have received growing attention in connection with scheduling problems. However, it is relatively un

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::53bd23f0bf6137be6c70bb9a03d3b186
https://doi.org/10.1007/s00500-019-04561-8

Zobrazit plný text záznamu

An iterated local search and tabu search for two-parallel machine scheduling problem to minimize the maximum total completion time

Autor: Pay-Wen Yu, Shang-Chia Liu, Chuanli Zhao, Win-Chin Lin, Junjie Wu, Jianyou Xu

Publikováno v: Journal of Information and Optimization Sciences. 40:751-766

The parallel machine scheduling problems exist in many real-life industrial examples. In order to effectively utilize the machines and decline the total waiting time of jobs assigned to eac...

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::3eaf9b83b10e30ccf835617aea66ad33
https://doi.org/10.1080/02522667.2018.1468610

Zobrazit plný text záznamu

A two-stage three-machine assembly flow shop scheduling with learning consideration to minimize the flowtime by six hybrids of particle swarm optimization

Autor: Win-Chin Lin, Kunjung Lai, Pay-Wen Yu, Jia-Yang Chen, Shang-Chia Liu, Chin-Chia Wu

Publikováno v: Swarm and Evolutionary Computation. 41:97-110

There have been many applications of two-stage three-machine assembly flow shop in query scheduling, such as fire engine assembly, personal computer manufacturing, and distributed database system. Moreover, learning phenomenon has been shown present

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e13d22e5da0b7df2772d04fded6cabbb
https://doi.org/10.1016/j.swevo.2018.01.012

Zobrazit plný text záznamu

Due date assignment and scheduling with time and positional dependent effects

Autor: Chou-Jung Hsu, Shang-Chia Liu, Chuanli Zhao, Win-Chin Lin, Pay-Wen Yu

Publikováno v: Journal of Information and Optimization Sciences. 39:1613-1626

This paper studies a due date assignment and single machine scheduling problem. In this model, the actual processing time of a job depended both on its start time and position in a sequence. Each job has to be assigned a due date by which it must be

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::3a3bea5a6d14b3bf3f5bf75e5970350a
https://doi.org/10.1080/02522667.2017.1367515

Zobrazit plný text záznamu

Single-machine batch scheduling problem with job rejection and resource dependent processing times

Autor: Weifan Huang, Chin-Chia Wu, Shang-Chia Liu

Publikováno v: RAIRO - Operations Research. 52:315-334

This paper addresses single-machine batch scheduling with job rejection and convex resource allocation. A job is either rejected, in which case a rejection penalty will be incurred, or accepted and processed on the machine. The accepted jobs are comb

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::316d26c92af33d9a6d0371af05465c77
https://doi.org/10.1051/ro/2017040

Zobrazit plný text záznamu

Bicriterion total flowtime and maximum tardiness minimization for an order scheduling problem

Autor: Chin-Chia Wu, Shang-Chia Liu, I-Hong Chung, Tzu-Yun Lin, Tzu-Hsuan Yang, Win-Chin Lin

Publikováno v: Computers & Industrial Engineering. 117:152-163

An order scheduling problem arises in numerous production scheduling environments. Makespan, mean flow time, and mean tardiness are the most commonly discussed and studied measurable criteria in the research community. Although the order scheduling m

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::077f9efbb97ee435e73b7143d7335b35
https://doi.org/10.1016/j.cie.2018.01.011

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání