An efficient optimal solution to the two-hoist no-wait cyclic scheduling problem

Simple item page
dc.citation.epage327en_US
dc.citation.issueNumber2en_US
dc.citation.spage313en_US
dc.citation.volumeNumber53en_US
dc.contributor.authorLiu, J.en_US
dc.contributor.authorJiang, Y.en_US
dc.date.accessioned2018-04-12T13:52:41Z
dc.date.available2018-04-12T13:52:41Z
dc.date.issued2005en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractHoist scheduling is a typical problem in the operation of electroplating systems. The cyclic scheduling policy is widely used in these systems in industry. Research on hoist scheduling has focused on the cyclic problem to minimize the cycle length. Most previous studies consider the single-hoist case. In practice, however, more than one hoist is often used in an electroplating line. This paper addresses the two-hoist, no-wait cyclic scheduling problem, in which the tank-processing times are constants and, upon completion of processing in a tank, the parts have to be moved to the next tank immediately. Based on the analysis of the problem properties, a polynomial algorithm is developed to obtain an optimal schedule. This algorithm first identifies a set of thresholds, which are special values of the cycle length, so that the feasibility property may change only at these thresholds. Feasibility checking is then carried out on each individual threshold in ascending order. The first feasible threshold found will be the optimal cycle length, and the corresponding feasible schedule is an optimal hoist schedule.en_US
dc.description.provenanceMade available in DSpace on 2018-04-12T13:52:41Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 179475 bytes, checksum: ea0bedeb05ac9ccfb983c327e155f0c2 (MD5) Previous issue date: 2005en
dc.identifier.doi10.1287/opre.1040.0167en_US
dc.identifier.eissn1526-5463
dc.identifier.issn0030-364X
dc.identifier.urihttp://hdl.handle.net/11693/38307
dc.language.isoEnglishen_US
dc.publisherInstitute for Operations Research and the Management Sciences (I N F O R M S)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1287/opre.1040.0167en_US
dc.source.titleOperations Researchen_US
dc.subjectManufacturing: automated electroplating systemsen_US
dc.subjectProduction/scheduling: cyclicen_US
dc.subjectTwo hoistsen_US
dc.subjectNo-waiten_US
dc.subjectNoncrossingen_US
dc.subjectRobotic cellsen_US
dc.titleAn efficient optimal solution to the two-hoist no-wait cyclic scheduling problemen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
An_efficient_optimal_solution_to_the_two-hoist_no-wait_cyclic_scheduling_problem.pdf
Size:
479.96 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Industrial Engineering