Abstract
We consider a scheduling problem in which the processors are arranged along a straight line, and each job requires simultaneous processing by multiple consecutive processors. We assume that the job sizes and processing times are agreeable. Our objective is to minimize the total weighted completion time of the jobs. This problem is motivated by the operation of berth allocation, which is to allocate vessels (jobs) to a berth with multiple quay cranes (processors), where a vessel may be processed by multiple consecutive cranes simultaneously. We develop a heuristic for the problem and perform worst-case analysis. © 2002 Elsevier Science B.V. All rights reserved.
| Original language | English |
|---|---|
| Pages (from-to) | 343-350 |
| Journal | Operations Research Letters |
| Volume | 30 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - Oct 2002 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Funding
This research was supported in part by Grant HKUST6205/99E from the Research Grants Council of Hong Kong. The authors would like to thank an anonymous referee for his/her valuable comments.
Research Keywords
- Heuristic
- Scheduling
- Sequencing
RGC Funding Information
- RGC-funded
Fingerprint
Dive into the research topics of 'A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver