A heuristic procedure for a single-item dynamic lot sizing problem
| dc.citation.epage | 192 | en_US |
| dc.citation.issueNumber | 2 | en_US |
| dc.citation.spage | 181 | en_US |
| dc.citation.volumeNumber | 14 | en_US |
| dc.contributor.author | Benli, O. S. | en_US |
| dc.contributor.author | Sabuncuoglu, I. | en_US |
| dc.contributor.author | Tufekci, S. | en_US |
| dc.date.accessioned | 2016-02-08T10:57:22Z | |
| dc.date.available | 2016-02-08T10:57:22Z | |
| dc.date.issued | 1988 | en_US |
| dc.department | Department of Industrial Engineering | en_US |
| dc.description.abstract | An O(T) heuristic proceudre for a single-item dynamic lot sizing problem is introduced in this paper. The algorithm tries to establish the regeneration points of the problem whether either the production or the beginning inventory must be equal to zero. The proposed algorithm is very easy to implement and compares very favourably with the existing heuristic procedures. © 1988. | en_US |
| dc.description.provenance | Made available in DSpace on 2016-02-08T10:57:22Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1988 | en |
| dc.identifier.doi | 10.1016/0360-8352(88)90027-7 | en_US |
| dc.identifier.issn | 0360-8352 | |
| dc.identifier.uri | http://hdl.handle.net/11693/26268 | |
| dc.language.iso | English | en_US |
| dc.publisher | Pergamon Press | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1016/0360-8352(88)90027-7 | en_US |
| dc.source.title | Computers and Industrial Engineering | en_US |
| dc.title | A heuristic procedure for a single-item dynamic lot sizing problem | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- A heuristic procedure for a single-item dynamic lot sizing problem.pdf
- Size:
- 625.6 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full Printable Version