An analysis of heuristics in a dynamic job shop with weighted tardiness objectives

Simple item page
dc.citation.epage187en_US
dc.citation.issueNumber1en_US
dc.citation.spage165en_US
dc.citation.volumeNumber37en_US
dc.contributor.authorKutanoglu, E.en_US
dc.contributor.authorSabuncuoğlu, İ.en_US
dc.date.accessioned2016-02-08T10:39:53Z
dc.date.available2016-02-08T10:39:53Z
dc.date.issued1999en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractMeeting due dates as a reflection of customer satisfaction is one of the scheduling criteria that is frequently encountered in today's manufacturing environments. The natural quantification of this qualitative goal involves tardiness related measures. In this study, we consider the dynamic job shop scheduling problem with the weighted tardiness criterion. After we present a comprehensive literature survey on the topic, we measure the long-run performances of more than 20 single-pass dispatching rules under various experimental conditions. In this study, we pay special attention to recently proposed dispatching heuristics such as CEXSPT, CR+ SPT, S/RPT+ SPT, and Bottleneck Dynamics (BD). We also investigate the effects of six resource pricing schemes proposed recently for BD. Moreover, we extend the earlier versions of inserted idleness and identify the conditions in which these techniques can be applied without incurring too much computational cost. Future research directions are also outlined in light of the computational results. © 1999 Taylor & Francis Ltd.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:39:53Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1999en
dc.identifier.doi10.1080/002075499191995en_US
dc.identifier.issn0020-7543
dc.identifier.urihttp://hdl.handle.net/11693/25142
dc.language.isoEnglishen_US
dc.publisherTaylor & Francisen_US
dc.relation.isversionofhttps://doi.org/10.1080/002075499191995en_US
dc.source.titleInternational Journal of Production Researchen_US
dc.subjectComputational complexityen_US
dc.subjectHeuristic methodsen_US
dc.subjectProblem solvingen_US
dc.subjectBottleneck Dynamics (BD)en_US
dc.subjectDispatching heuristicsen_US
dc.subjectDynamic job shop schedulingen_US
dc.subjectWeighted tardiness criterionen_US
dc.subjectProduction controlen_US
dc.titleAn analysis of heuristics in a dynamic job shop with weighted tardiness objectivesen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
An analysis of heuristics in a dynamic job shop with weighted tardiness objectives.pdf
Size:
438.2 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Industrial Engineering