hrcak mascot   Srce   HID

Izvorni znanstveni članak

Some Precedence Relations in Single Machine Sequencing

Kristina Šorić ; Faculty of Economics, Zagreb, Croatia

Puni tekst: engleski, pdf (3 MB) str. 231-238 preuzimanja: 48* citiraj
APA 6th Edition
Šorić, K. (1997). Some Precedence Relations in Single Machine Sequencing. Journal of computing and information technology, 5 (4), 231-238. Preuzeto s https://hrcak.srce.hr/150249
MLA 8th Edition
Šorić, Kristina. "Some Precedence Relations in Single Machine Sequencing." Journal of computing and information technology, vol. 5, br. 4, 1997, str. 231-238. https://hrcak.srce.hr/150249. Citirano 02.03.2021.
Chicago 17th Edition
Šorić, Kristina. "Some Precedence Relations in Single Machine Sequencing." Journal of computing and information technology 5, br. 4 (1997): 231-238. https://hrcak.srce.hr/150249
Harvard
Šorić, K. (1997). 'Some Precedence Relations in Single Machine Sequencing', Journal of computing and information technology, 5(4), str. 231-238. Preuzeto s: https://hrcak.srce.hr/150249 (Datum pristupa: 02.03.2021.)
Vancouver
Šorić K. Some Precedence Relations in Single Machine Sequencing. Journal of computing and information technology [Internet]. 1997 [pristupljeno 02.03.2021.];5(4):231-238. Dostupno na: https://hrcak.srce.hr/150249
IEEE
K. Šorić, "Some Precedence Relations in Single Machine Sequencing", Journal of computing and information technology, vol.5, br. 4, str. 231-238, 1997. [Online]. Dostupno na: https://hrcak.srce.hr/150249. [Citirano: 02.03.2021.]

Sažetak
A model for real-time control of flexible manufacturing systems is considered. In this model, a machine can process a finite number of part types at specified rates, but only one part type can be processed at any given time. Each switch from one type to another requires different setup times.

A better upper bound on the total work backlog than those available in literature is derived by introducing the clear-the-largest-work-after- setup (CLWS) heuristic policy which stabilizes the system in the sense that, in the long run, the required demand is met.

Studying whether the CLWS scheduling policy induces convergence to a stationary state, some precedence relations between part types are reported with the computational results.

Ključne riječi
single machine sequencing; CLWS heuristic; upper bound; precedence relations

Hrčak ID: 150249

URI
https://hrcak.srce.hr/150249

Posjeta: 98 *