EconPapers    
Economics at your fingertips  
 

Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration

Wen-Hsiang Wu (), Yunqiang Yin (), Shuenn-Ren Cheng (), Peng-Hsiang Hsu () and Chin-Chia Wu ()
Additional contact information
Wen-Hsiang Wu: Department of Healthcare Management, Yuanpei University, Hsinchu, Taiwan
Yunqiang Yin: Faculty of Science, Kunming University of Science and Technology, Kunming 650093, China
Shuenn-Ren Cheng: Graduate Institute of Business Administration, Cheng Shiu University, Kaohsiung County, Taiwan
Peng-Hsiang Hsu: Department of Business Administration, Kang-Ning Junior College of Medical Care and Management, Taipei, Taiwan
Chin-Chia Wu: Department of Statistics, Feng Chia University, Taichung, Taiwan

Asia-Pacific Journal of Operational Research (APJOR), 2014, vol. 31, issue 06, 1-23

Abstract: Scheduling with learning effects has received lots of research attention lately. However, the multiple-agent setting with learning consideration is relatively limited. On the other hand, the actual processing time of a job under an uncontrolled learning effect will drop to zero precipitously as the number of the jobs already processed increases. This is rather absurd in reality. Based on these observations, this paper considers a single-machine two-agent scheduling problem in which the actual processing time of a job depends not only on the job's scheduled position, but also on a control parameter. The objective is to minimize the total weighted completion time of jobs from the first agent with the restriction that no tardy job is allowed for the second agent. A branch-and-bound algorithm incorporated with several dominance properties and lower bounds is proposed to derive the optimal solution for the problem. In addition, genetic algorithms (GAs) are also provided to obtain the near-optimal solution. Finally, a computational experiment is conducted to evaluate the performance of the proposed algorithms.

Keywords: Scheduling; genetic algorithm; truncated learning function (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595914500468
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:31:y:2014:i:06:n:s0217595914500468

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595914500468

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().

 
Page updated 2025-03-20
Handle: RePEc:wsi:apjorx:v:31:y:2014:i:06:n:s0217595914500468