DC Field | Value | Language |
---|---|---|
dc.contributor.author | Seo, JW | ko |
dc.contributor.author | Lee, Tae-Eog | ko |
dc.date.accessioned | 2008-01-25T02:04:30Z | - |
dc.date.available | 2008-01-25T02:04:30Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2002-10 | - |
dc.identifier.citation | INTERNATIONAL JOURNAL OF FLEXIBLE MANUFACTURING SYSTEMS, v.14, no.4, pp.291 - 318 | - |
dc.identifier.issn | 0920-6299 | - |
dc.identifier.uri | http://hdl.handle.net/10203/2913 | - |
dc.description.abstract | A cyclic shop is a production system that repeatedly produces identical sets of parts of multiple types, called minimal part sets (MPSs), in the same loading and processing sequence. A different part type may have a different machine visit sequence. We consider a version of cyclic job shop where some operations of an MPS instance are processed prior to some operations of the previous MPS instances. We call such a shop an overtaking cyclic job shop (OCJS). The overtaking degree can be specified by how many MPS instances the operations of an MPS instance can overtake. More overtaking results in more work-in-progress, but reduces the cycle time, in general. We prove that for a given processing sequence of the operations at each machine, under some conditions, an OCJS has a stable earliest starting schedule such that each operation starts as soon as its preceding operations are completed, the schedule repeats an identical timing pattern for each MPS instance, and the cycle time is kept to be minimal. To do these, we propose a specialized approach to analyzing steady states for an event graph model of an OCJS that has a cyclic structure, which can keep the MPS-based scheduling concept. Based on the steady-state results, we develop a mixed integer programming model for finding a processing sequence of the operations at each machine and the overtaking degrees, if necessary, that minimize the cycle time. | - |
dc.description.sponsorship | National Research Laboratory Grant(2000-N-NL-01-C-124)on Virtual Manufacturing Systems from Ministry of Science and Technology, Korea and Brain Korea 21 Grant(2001)of Ministry of Education and Human Resources Development | en |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | KLUWER ACADEMIC PUBL | - |
dc.title | Steady-state analysis and scheduling of cyclic job shops with overtaking | - |
dc.type | Article | - |
dc.identifier.wosid | 000178950400001 | - |
dc.identifier.scopusid | 2-s2.0-0036820026 | - |
dc.type.rims | ART | - |
dc.citation.volume | 14 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 291 | - |
dc.citation.endingpage | 318 | - |
dc.citation.publicationname | INTERNATIONAL JOURNAL OF FLEXIBLE MANUFACTURING SYSTEMS | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Lee, Tae-Eog | - |
dc.contributor.nonIdAuthor | Seo, JW | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | cyclic scheduling | - |
dc.subject.keywordAuthor | event graph | - |
dc.subject.keywordAuthor | overtaking | - |
dc.subject.keywordAuthor | steady state | - |
dc.subject.keywordPlus | WAIT ROBOTIC CELLS | - |
dc.subject.keywordPlus | PERFORMANCE EVALUATION | - |
dc.subject.keywordPlus | PETRI NETS | - |
dc.subject.keywordPlus | SYSTEMS | - |
dc.subject.keywordPlus | COMPLEXITY | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.