Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/662
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Yuan, JJ | - |
dc.creator | Yang, AF | - |
dc.creator | Cheng, TCE | - |
dc.date.accessioned | 2014-12-11T08:27:31Z | - |
dc.date.available | 2014-12-11T08:27:31Z | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.uri | http://hdl.handle.net/10397/662 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | European Journal of Operational Research © 2003 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com. | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Precedence constraints | en_US |
dc.subject | Batches | en_US |
dc.title | A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 525 | - |
dc.identifier.epage | 528 | - |
dc.identifier.volume | 158 | - |
dc.identifier.issue | 2 | - |
dc.identifier.doi | 10.1016/S0377-2217(03)00361-8 | - |
dcterms.abstract | We consider the single machine, serial batching scheduling problem 1|prec;p[sub j]=p;s-batch;r[sub j]|L[sub max]. The complexity of this problem is reported as open in the literature. By reducing this problem to the version without precedence constraints, we show that the problem is polynomially solvable. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | European journal of operational research, 16 Oct. 2004, v. 158, no. 2, p. 525-528 | - |
dcterms.isPartOf | European journal of operational research | - |
dcterms.issued | 2004-10-16 | - |
dc.identifier.isi | WOS:000222135200021 | - |
dc.identifier.scopus | 2-s2.0-2642544022 | - |
dc.identifier.eissn | 1872-6860 | - |
dc.identifier.rosgroupid | r21194 | - |
dc.description.ros | 2004-2005 > 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 | |
---|---|---|---|---|
s-batch--release--lateness-v3.pdf | Pre-published version | 119.21 kB | Adobe PDF | View/Open |
Page views
110
Last Week
0
0
Last month
Citations as of Mar 24, 2024
Downloads
185
Citations as of Mar 24, 2024
SCOPUSTM
Citations
15
Last Week
0
0
Last month
0
0
Citations as of Mar 28, 2024
WEB OF SCIENCETM
Citations
11
Last Week
0
0
Last month
0
0
Citations as of Mar 28, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.