Show simple item record

dc.contributor.advisorSabuncuoğlu, İhsanen_US
dc.contributor.authorZarifoğlu, Emrahen_US
dc.date.accessioned2016-07-01T11:03:02Z
dc.date.available2016-07-01T11:03:02Z
dc.date.issued2005
dc.identifier.urihttp://hdl.handle.net/11693/29671
dc.descriptionCataloged from PDF version of article.en_US
dc.description.abstractBusinesses deal with huge databases over a geographically distributed supply network. When this is combined with scheduling and planning needs, it becomes too difficult to handle. Recently, Fast Consumer Goods sector tends to consolidate their manufacturing facilities on a single supplier serving to a distributed customer network. This decentralized structure causes imperfect information sharing between customers and the supplier. We model this problem as a single machine distributed scheduling problem with job agents representing the customers and the machine agent representing the supplier. For benchmarking purpose, we analyzed the problem under three different scenarios: decentralized utility case (realistic case), centralized utility case, centralized cost case (classical single machine early/tardy problem). We developed Auction Based Algorithm by exploiting the opportunity to use game theoretic approach to solve the problem in the decentralized utility case. We used optimization techniques (Lagrangean Relaxation and Branch-and-Bound) for the centralized cases. Results of our extensive computational experiments indicate that Auction Based Algorithm converges to the upper bound found for the total utility measure.en_US
dc.description.statementofresponsibilityZarifoğlu, Emrahen_US
dc.format.extentxi, 115 leavesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectSchedulingen_US
dc.subjectDistributed Schedulingen_US
dc.subjectDecentralized Schedulingen_US
dc.subjectSupply Chain Schedulingen_US
dc.subjectAuction Based Schedulingen_US
dc.subjectSingle Machine Schedulingen_US
dc.subjectAuctionsen_US
dc.subjectLagrangean Relaxationen_US
dc.subject.lccTS157.5 .Z37 2005en_US
dc.subject.lcshScheduling Data rocessing.en_US
dc.titleAuction based scheduling for distributed systemsen_US
dc.typeThesisen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidBILKUTUPB091934


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record