Taipei, Taiwan
Taipei, Taiwan

Time filter

Source Type

Yin Y.,Kunming University of Science and Technology | Yin Y.,East China Institute of Technology | Wu W.-H.,Kang Ning Junior College | Cheng T.C.E.,Feng Chia University | Wu C.-C.,Feng Chia University
International Journal of Computer Integrated Manufacturing | Year: 2015

In many real-life scheduling situations, the jobs deteriorate at a certain rate while waiting to be processed. This study introduces a new deterioration model where the actual processing time of a job depends not only on the starting time of the job but also on its scheduled position. The objective is to find the optimal schedule such that the makespan or total completion time is minimised. This study first shows that both problems are solvable in O(n log n) time. This study further shows that in both cases there exists an optimal schedule that is the shortest processing time, longest processing time, or V-shaped with respect to the job normal processing times, depending on the relationships between problem parameters. © 2014 Taylor & Francis.


Cheng T.C.E.,Hong Kong Polytechnic University | Cheng S.-R.,Cheng Shiu University | Wu W.-H.,Kang Ning Junior College | Hsu P.-H.,Feng Chia University | Wu C.-C.,Feng Chia University
Computers and Industrial Engineering | Year: 2011

Scheduling with learning effects has received a lot of research attention lately. By learning effect, we mean that job processing times can be shortened through the repeated processing of similar tasks. On the other hand, different entities (agents) interact to perform their respective tasks, negotiating among one another for the usage of common resources over time. However, research in the multi-agent setting is relatively limited. Meanwhile, the actual processing time of a job under an uncontrolled learning effect will drop to zero precipitously as the number of jobs increases or a job with a long processing time exists. Motivated by these observations, we consider a two-agent scheduling problem in which the actual processing time of a job in a schedule is a function of the sum-of-processing-times-based learning and a control parameter of the learning function. The objective is to minimize the total weighted completion time of the jobs of the first agent with the restriction that no tardy job is allowed for the second agent. We develop a branch-and-bound and three simulated annealing algorithms to solve the problem. Computational results show that the proposed algorithms are efficient in producing near-optimal solutions. © 2010 Published by Elsevier Ltd. All rights reserved.


Yin Y.,East China Institute of Technology | Wu W.-H.,Kang Ning Junior College | Cheng T.C.E.,Hong Kong Polytechnic University | Wu C.-C.,Feng Chia University
International Journal of Production Research | Year: 2014

This paper addresses a single-machine scheduling problem with simultaneous consideration of due-date assignment, generalised position-dependent deteriorating jobs, and deteriorating maintenance activities. It is assumed that the actual processing time of a job is a general non-decreasing function depending on the number of maintenance activities performed before it and its position in a sequence. Moreover, the machine may be subject to several maintenance activities up to a limit over the scheduling horizon. The maintenance activities do not necessarily restore the machine fully to its original perfect state and the duration of a maintenance activity depends on its start time. The objective is to find jointly the optimal job sequence, maintenance frequency and maintenance positions to minimise an objective function that includes the cost of due-date assignment, the cost of discarding jobs that cannot be completed by their due dates and the earliness of the scheduled jobs under the popular CON and SLK due-date assignment methods. We provide polynomial-time solution algorithms for various versions of the problem. © 2013 Taylor & Francis.


Wu W.-H.,Kang Ning Junior College
International Journal of Computer Integrated Manufacturing | Year: 2014

Scheduling with learning effects has been widely studied. However, there has been little work done on multi-agent scheduling with learning effects. This article investigates a two-agent single-machine scheduling problem with learning effects via an objective function which minimises the weighted completion time of all the jobs subject to a constraint that one agent makespan cannot exceed a prescribed upper bound. This article develops a branch-and-bound algorithm along with three simulated-annealing (SA) algorithms searching for an optimal and near-optimal solution. The computational results show that all the average error percentages of combined SA algorithms are less than 0.076%. © 2013 Taylor & Francis.


Li D.-C.,National Cheng Kung University | Hsu P.-H.,National Cheng Kung University | Hsu P.-H.,Kang Ning Junior College
Mathematical Problems in Engineering | Year: 2013

The learning effect has gained much attention in the scheduling research recently, where many researchers have focused their problems on only one optimization. This study further addresses the scheduling problem in which two agents compete to perform their own jobs with release times on a common single machine with learning effect. The aim is to minimize the total weighted completion time of the first agent, subject to an upper bound on the maximum lateness of the second agent. We propose a branch-and-bound approach with several useful dominance properties and an effective lower bound for searching the optimal solution and three simulated-annealing algorithms for the near-optimal solutions. The computational results show that the proposed algorithms perform effectively and efficiently. © 2013 Der-Chiang Li and Peng-Hsiang Hsu.


Yin Y.,East China Institute of Technology | Wu C.-C.,Feng Chia University | Wu W.-H.,Yuanpei University | Hsu C.-J.,Nan Kai College | Wu W.-H.,Kang Ning Junior College
Applied Soft Computing Journal | Year: 2013

This paper addresses a two-agent scheduling problem on a single machine where the objective is to minimize the total weighted earliness cost of all jobs, while keeping the earliness cost of one agent below or at a fixed level Q. A mixed-integer programming (MIP) model is first formulated to find the optimal solution which is useful for small-size problem instances. To solve medium-to large-size problem instances, a branch-and-bound algorithm incorporating with several dominance properties and a lower bound is then provided to derive the optimal solution. A simulated annealing heuristic algorithm incorporating with a heuristic procedure is developed to derive the near-optimal solutions for the problem. A computational experiment is also conducted to evaluate the performance of the proposed algorithms. © 2012 Elsevier B.V. All rights reserved.


Li D.-C.,National Cheng Kung University | Hsu P.-H.,National Cheng Kung University | Hsu P.-H.,Kang Ning Junior College
Computers and Operations Research | Year: 2012

Scheduling with multiple agents and learning effect has drawn much attention. In this paper, we investigate the job scheduling problem of two agents competing for the usage of a common single machine with learning effect. The objective is to minimize the total weighted completion time of both agents with the restriction that the makespan of either agent cannot exceed an upper bound. In order to solve this problem we develop several dominance properties and a lower bound based on a branch-and-bound to find the optimal algorithm, and derive genetic algorithm based procedures for finding near-optimal solutions. The performances of the proposed algorithms are evaluated and compared via computational experiments. © 2011 Elsevier Ltd. All rights reserved.


Yin Y.,East China Institute of Technology | Wu W.-H.,Yuanpei University | Wu W.-H.,Kang Ning Junior College | Wu C.-C.,Feng Chia University
Information Sciences | Year: 2014

This study considers an NP-hard problem of minimizing the total tardiness on a single machine with arbitrary release dates and position-dependent learning effects. A mixed-integer programming (MIP) model is first formulated to find the optimal solution for small-size problem instances. Some new dominance rules are then presented which provide a sufficient condition for finding local optimality. The branch-and-bound (B& B) strategy incorporating with several dominance properties and a lower bound is proposed to derive the optimal solution for medium- to-large-size problem instances, and four marriage-in-honey-bees optimization algorithms (MBO) are developed to derive near-optimal solutions for the problem. To show the effectiveness of the proposed algorithms, 3600 situations with 20 and 25 jobs, are randomly generated for experiments. © 2013 Elsevier Inc. All rights reserved.


Wu C.-C.,Feng Chia University | Wu W.-H.,Yuanpei University | Wu W.-H.,Kang Ning Junior College | Hsu P.-H.,Kang Ning Junior College | And 2 more authors.
Information Sciences | Year: 2014

Recently, machine scheduling problems with deteriorating jobs have received interestingly attention from the scheduling research community. Majority of the research assumed that the actual job processing time is an increasing function of its starting time. However, no job can remain undeteriorated indefinitely in real life situations. This paper considers a single-machine scheduling problem with a truncated linear deteriorating effect and ready times. By the truncated linear deteriorating effect, it means that the actual processing time of a job is a function of its starting time and a control parameter. The objective is to minimize the makespan. A mixed integer programming model and a branch-and-bound algorithm coupled with several dominance properties and two lower bounds are developed to search for the optimal solution. In addition, an ant colony and a Tabu search algorithm where each is refined by the three improvements are also proposed for a near-optimal solution, respectively. A computational experiment is then conducted to evaluate the impacts of the used parameters on the performances of the proposed algorithms. © 2013 Elsevier Inc. All rights reserved.


PubMed | Tri Service General Hospital, A-Life Medical, China Medical University at Taichung, Graduate Institute of Medical science and 4 more.
Type: Journal Article | Journal: Oncotarget | Year: 2016

The availability of adequate cancer stem cells or cancer stem-like cell (CSC) is important in cancer study. From ovarian cancer cell lines, SKOV3 and OVCAR3, we induced peritoneal ascites tumors in immunodeficient mice. Among the cells (SKOV3.PX1 and OVCAR3.PX1) from those tumors, we sorted both CD44 and CD133 positive cells (SKOV3.PX1_133+44+, OVCAR3.PX1_133+44+), which manifest the characteristics of self-renewal, multi-lineage differentiation, chemoresistance and tumorigenicity, those of cancer stem-like cells (CSLC). Intraperitoneal transplantation of these CD44 and CD133 positive cells resulted in poorer survival in the engrafted animals. Clinically, increased CD133 expression was found in moderately and poorly differentiated (grade II and III) ovarian serous cystadenocarcinomas. The ascites tumor cells from human ovarian cancers demonstrated more CD133 and CD44 expressions than those from primary ovarian or metastatic tumors and confer tumorigenicity in immunodeficient mice. Compared to their parental cells, the SKOV3.PX1_133+44+ and OVCAR3.PX1_133+44+ cells uniquely expressed 5 CD markers (CD97, CD104, CD107a, CD121a, and CD125). Among these markers, CD97, CD104, CD107a, and CD121a are significantly more expressed in the CD133+ and CD44+ double positive cells of human ovarian ascites tumor cells (Ascites_133+44+) than those from primary ovarian or metastatic tumors. The cancer stem-like cells were enriched from 3% to more than 70% after this manipulation. This intraperitoneal enrichment of cancer stem-like cells, from ovarian cancer cell lines or primary ovarian tumor, potentially provides an adequate amount of ovarian cancer stem-like cells for the ovarian cancer study and possibly benefits cancer therapy.

Loading Kang Ning Junior College collaborators
Loading Kang Ning Junior College collaborators