caa a22 4500 475778316 CHVBK 20180406123637.0 cr unu---uuuuu 170329e20000201xx s 000 0 eng 10.1023/A:1008123115577 doi (NATIONALLICENCE)springer-10.1023/A:1008123115577 Lee Tae-Eog Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Taejon, Korea aut Stable Earliest Starting Schedules for Cyclic Job Shops: A Linear System Approach [Elektronische Daten] [Tae-Eog Lee] 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. Kluwer Academic Publishers, 2000 linear system nationallicence minimax algebra nationallicence cyclic job shop nationallicence scheduling nationallicence International Journal of Flexible Manufacturing Systems Kluwer Academic Publishers 12/1(2000-02-01), 59-80 0920-6299 12:1<59 2000 12 10696 https://doi.org/10.1023/A:1008123115577 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1023/A:1008123115577 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Lee Tae-Eog Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Taejon, Korea aut NATIONALLICENCE 773 0- International Journal of Flexible Manufacturing Systems Kluwer Academic Publishers 12/1(2000-02-01), 59-80 0920-6299 12:1<59 2000 12 10696 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer