Online Order Scheduling Problem with the Same Order Size on Two Identical Machines

Qian Cao, Yi Li () and Guohua Wan ()
Additional contact information
Qian Cao: College of Economics and Management, Shanghai University of Electric Power, Shanghai 201399, P. R. China
Yi Li: Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai 200030, P. R. China
Guohua Wan: Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai 200030, P. R. China

Asia-Pacific Journal of Operational Research (APJOR), 2017, vol. 34, issue 02, 1-9

Abstract: In this paper, we consider an online order scheduling problem with the same order size on two identical machines. The objective is to minimize the makespan. An order list O = (O1,O2,…,Ob) is given, where b is a positive integer. For the problem under study, we assume that b ≥ B (B = 2, 3, 4,…), that is to say, at least B orders arrive. A lower bound B+2 B+1 for b ≥ B is obtained. Also, we design two optimal algorithms A1 and A2 for B = 2m and B = 2m + 1 (m = 1, 2, 3,…), respectively.

Keywords: Online; order scheduling; identical machines (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595917500063
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:34:y:2017:i:02:n:s0217595917500063

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595917500063

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