Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1267
| Title: | An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines | Authors: | Nong, QQ Cheng, TCE Ng, CTD |
Issue Date: | Sep-2008 | Source: | Operations research letters, Sept. 2008, v. 36, no. 5, p. 584-588 | Abstract: | We consider the problem of on-line scheduling a set of n jobs on two parallel batch processing machines. The objective is to minimize the makespan. (See Article file for details of the abstract.) | Keywords: | On-line scheduling Parallel machines Batch Worst-case analysis Competitive ratio |
Publisher: | Elsevier | Journal: | Operations research letters | ISSN: | 0167-6377 | EISSN: | 1872-7468 | DOI: | 10.1016/j.orl.2008.03.004 | Rights: | Operations Research Letters © 2008 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com. |
| Appears in Collections: | Journal/Magazine Article |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| P2-batch-online.pdf | Pre-published version | 180.89 kB | Adobe PDF | View/Open |
Access
View full-text via PolyU eLinks 
Page views
187
Last Week
0
0
Last month
Citations as of Apr 14, 2024
Downloads
232
Citations as of Apr 14, 2024
SCOPUSTM
Citations
20
Last Week
0
0
Last month
0
0
Citations as of Apr 12, 2024
WEB OF SCIENCETM
Citations
17
Last Week
0
0
Last month
0
0
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.