Show simple item record

dc.contributor.authorErenguc, S. S.en_US
dc.contributor.authorTufekci, S.en_US
dc.date.accessioned2016-02-08T10:57:30Z
dc.date.available2016-02-08T10:57:30Z
dc.date.issued1988en_US
dc.identifier.issn0377-2217
dc.identifier.urihttp://hdl.handle.net/11693/26279
dc.description.abstractWe consider a certain T period aggregate production planning model, where the two sources of production are regular and overtime. The model allows for time varying production, holding and backordering costs and includes bounds on inventory and backorders. We show that the problem has a rather interesting network structure and exploit this structure to develop a greedy algorithm to solve the problem. The procedure is easy to implement and has a computational complexity of O(T2). We report computational experience with the greedy procedure and demonstrate its superiority to a well known network simplex code, Gnet, implemented on the classical network formulation of the problem. © 1988.en_US
dc.language.isoEnglishen_US
dc.source.titleEuropean Journal of Operational Researchen_US
dc.relation.isversionofhttps://doi.org/10.1016/0377-2217(88)90231-7en_US
dc.subjectAggregate schedulingen_US
dc.titleA transportation type aggregate production model with bounds on inventory and backorderingen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage414en_US
dc.citation.epage425en_US
dc.citation.volumeNumber35en_US
dc.citation.issueNumber3en_US
dc.identifier.doi10.1016/0377-2217(88)90231-7en_US
dc.publisherElsevieren_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record