Stable earliest starting schedules for cyclic job shops: A linear system approach

Cited 41 time in webofscience Cited 0 time in scopus
  • Hit : 1029
  • Download : 180
We consider a cyclic job shop where an identical mixture of parts of different types, called a minimal part set (MPS), is produced repetitively in the same processing order. The precedence relationships among events (start of operation) are represented by a directed graph that has a recurrent structure. Each operation starts as soon as all its preceding operations are complete (called earliest starting). There is a class of desirable schedules that has the minimum cycle time and an identical schedule pattern for every MPS. By using linear system theory on minimax algebra, we characterize the set of all possible such schedules. We develop an efficient algorithm to find one among such schedules that minimizes a performance measure related to work-in-progress inventory. We also discuss an application to a flexible manufacturing system.
Publisher
KLUWER ACADEMIC PUBL
Issue Date
2000-02
Language
English
Article Type
Article
Keywords

PERFORMANCE EVALUATION; TIME; ALGORITHMS

Citation

INTERNATIONAL JOURNAL OF FLEXIBLE MANUFACTURING SYSTEMS, v.12, no.1, pp.59 - 80

ISSN
0920-6299
URI
http://hdl.handle.net/10203/2912
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 41 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0