Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/658
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Ji, M | - |
dc.creator | He, Y | - |
dc.creator | Cheng, TCE | - |
dc.date.accessioned | 2014-12-11T08:27:36Z | - |
dc.date.available | 2014-12-11T08:27:36Z | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.uri | http://hdl.handle.net/10397/658 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | European Journal of Operational Research © 2005 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com. | en_US |
dc.subject | Single machine scheduling | en_US |
dc.subject | Batch delivery cost | en_US |
dc.subject | Optimal algorithm | en_US |
dc.subject | Computational complexity | en_US |
dc.title | Batch delivery scheduling with batch delivery cost on a single machine | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 745 | - |
dc.identifier.epage | 755 | - |
dc.identifier.volume | 176 | - |
dc.identifier.issue | 2 | - |
dc.identifier.doi | 10.1016/j.ejor.2005.09.006 | - |
dcterms.abstract | We consider a scheduling problem in which n independent and simultaneously available jobs are to be processed on a single machine. The jobs are delivered in batches and the delivery date of a batch equals the completion time of the last job in the batch. The delivery cost depends on the number of deliveries. The objective is to minimize the sum of the total weighted flow time and delivery cost. We first show that the problem is strongly NP-hard. Then we show that, if the number of batches is B, the problem remains strongly NP-hard when B ≤ U for a variable U ≥ 2 or B ≥ U for any constant U ≥ 2. For the case of B ≤ U, we present a dynamic programming algorithm that runs in pseudo-polynomial time for any constant U ≥ 2. Furthermore, optimal algorithms are provided for two special cases: (i) jobs have a linear precedence constraint, and (ii) jobs satisfy the agreeable ratio assumption, which is valid, for example, when all the weights or all the processing times are equal. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | European journal of operational research, 16 Jan. 2007, v. 176, no. 2, p. 745-755 | - |
dcterms.isPartOf | European journal of operational research | - |
dcterms.issued | 2007-01-16 | - |
dc.identifier.isi | WOS:000241709800005 | - |
dc.identifier.scopus | 2-s2.0-33749553996 | - |
dc.identifier.eissn | 1872-6860 | - |
dc.identifier.rosgroupid | r34616 | - |
dc.description.ros | 2006-2007 > Academic research: refereed > Publication in refereed journal | - |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Batch_v16.pdf | Pre-published version | 181.04 kB | Adobe PDF | View/Open |
Page views
188
Last Week
0
0
Last month
Citations as of Apr 21, 2024
Downloads
279
Citations as of Apr 21, 2024
SCOPUSTM
Citations
50
Last Week
0
0
Last month
2
2
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
41
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.