A SEMI-ON-LINE SCHEDULING PROBLEM OF TWO PARALLEL MACHINES WITH COMMON MAINTENANCE TIME

Yuhua Cai (), Qi Feng () and Wenjie Li ()
Additional contact information
Yuhua Cai: Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450001, People's Republic of China
Qi Feng: College of Science, Zhongyuan University of Technology, Zhengzhou, Henan 450007, People's Republic of China
Wenjie Li: Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450001, People's Republic of China

Asia-Pacific Journal of Operational Research (APJOR), 2012, vol. 29, issue 04, 1-13

Abstract: In this paper, we consider a semi-on-line scheduling problem of two identical machines with common maintenance time interval and nonresumable availability. We prove a lower bound of 2.79129 on the competitive ratio and give an on-line algorithm with competitive ratio 2.79633 for this problem.

Keywords: Semi-on-line scheduling; on-line algorithm; competitive ratio; common maintenance time (search for similar items in EconPapers)
Date: 2012
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595912500200
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:29:y:2012:i:04:n:s0217595912500200

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595912500200

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 ().