A scheduling problem for two competing queues with finite capacity and non-negligible setup times

Author

Gaudio, Massimo Del ; Martinelli, Francesco ; Valigi, Paolo

Author_Institution

Dipt. di Informatica, Sistemi e Produzione, Rome Univ., Italy

Volume

3

fYear

2001

fDate

2001

Firstpage

2355

Abstract

We consider a setup scheduling problem for a manufacturing system with finite buffers. Some analytical results for the infinite capacity case are also included. The system comprises a non-perfect, reliable single machine processing two part types, modeled by means of a fluid approximation. The objective of the control is to minimize an index cost under steady and transient conditions. Dynamic programming is used to derive the structure of the optimal policy and some initial analytical results are given. A symmetry assumption on part types is considered to simplify the problem

Keywords

costing; dynamic programming; production control; queueing theory; competing queues; dynamic programming; finite buffers; fluid approximation; index cost; manufacturing system; production control; setup scheduling; single machine processing; Cost function; Dynamic programming; Job shop scheduling; Limit-cycles; Manufacturing systems; Production systems; Single machine scheduling; Stochastic processes; Stochastic systems; Switches;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 2001. Proceedings of the 40th IEEE Conference on

Conference_Location

Orlando, FL

Print_ISBN

0-7803-7061-9

Type

conf

DOI

10.1109/.2001.980613

Filename

980613