Production Scheduling in a Flexible Manufacturing System under Random Demand

This paper considers the problem of production scheduling in a Flexible Manufacturing System (FMS) with stochastic demand. With FMS, there is inherent flexibility made available to production. However, it is not always that the entire mix of parts can be processed simultaneously. As such, grouping o...

全面介紹

Saved in:
書目詳細資料
Main Authors: MOOSA, Sharafali, CO, Henry C., GOH, Mark
格式: text
語言:English
出版: Institutional Knowledge at Singapore Management University 2004
主題:
在線閱讀:https://ink.library.smu.edu.sg/lkcsb_research/887
https://doi.org/10.1016/s0377-2217(03)00300-x
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Singapore Management University
語言: English
id sg-smu-ink.lkcsb_research-1886
record_format dspace
spelling sg-smu-ink.lkcsb_research-18862016-01-06T15:09:31Z Production Scheduling in a Flexible Manufacturing System under Random Demand MOOSA, Sharafali CO, Henry C. GOH, Mark This paper considers the problem of production scheduling in a Flexible Manufacturing System (FMS) with stochastic demand. With FMS, there is inherent flexibility made available to production. However, it is not always that the entire mix of parts can be processed simultaneously. As such, grouping of the part types is needed. The problem complexity increases when both demand and processing times are random. In this paper, we model the problem as a polling model with the objective of minimizing the total average cost. First, we consider a special cost rate problem whereby the holding cost is assumed proportional to the processing time and inversely proportional to the FMS load factor. Here, three situations are compared: (i) no mixing is allowed among part-families; (ii) a particular part-family, with an independent production schedule, can also be produced with other families; and (iii) a particular part-family with no independent production schedule but can be mixed with all the other families. Under certain conditions of the mixing proportions, we derive conditions for one situation to dominate the others. Next, an optimization model is considered which determines the optimal mixing proportions, if the decision to mix the part-family with other part-families is taken. Specifically, we find that any family with no independent production schedule should always be mixed with the part-family that offers the highest load to the FMS. Finally, we show how the general holding cost rate problem can be analysed using approximate results found in the polling literature. 2004-10-01T07:00:00Z text https://ink.library.smu.edu.sg/lkcsb_research/887 info:doi/10.1016/s0377-2217(03)00300-x https://doi.org/10.1016/s0377-2217(03)00300-x Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Flexible manufacturing system Part-family formulation Polling systems Operations and Supply Chain Management Operations Research, Systems Engineering and Industrial Engineering
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Flexible manufacturing system
Part-family formulation
Polling systems
Operations and Supply Chain Management
Operations Research, Systems Engineering and Industrial Engineering
spellingShingle Flexible manufacturing system
Part-family formulation
Polling systems
Operations and Supply Chain Management
Operations Research, Systems Engineering and Industrial Engineering
MOOSA, Sharafali
CO, Henry C.
GOH, Mark
Production Scheduling in a Flexible Manufacturing System under Random Demand
description This paper considers the problem of production scheduling in a Flexible Manufacturing System (FMS) with stochastic demand. With FMS, there is inherent flexibility made available to production. However, it is not always that the entire mix of parts can be processed simultaneously. As such, grouping of the part types is needed. The problem complexity increases when both demand and processing times are random. In this paper, we model the problem as a polling model with the objective of minimizing the total average cost. First, we consider a special cost rate problem whereby the holding cost is assumed proportional to the processing time and inversely proportional to the FMS load factor. Here, three situations are compared: (i) no mixing is allowed among part-families; (ii) a particular part-family, with an independent production schedule, can also be produced with other families; and (iii) a particular part-family with no independent production schedule but can be mixed with all the other families. Under certain conditions of the mixing proportions, we derive conditions for one situation to dominate the others. Next, an optimization model is considered which determines the optimal mixing proportions, if the decision to mix the part-family with other part-families is taken. Specifically, we find that any family with no independent production schedule should always be mixed with the part-family that offers the highest load to the FMS. Finally, we show how the general holding cost rate problem can be analysed using approximate results found in the polling literature.
format text
author MOOSA, Sharafali
CO, Henry C.
GOH, Mark
author_facet MOOSA, Sharafali
CO, Henry C.
GOH, Mark
author_sort MOOSA, Sharafali
title Production Scheduling in a Flexible Manufacturing System under Random Demand
title_short Production Scheduling in a Flexible Manufacturing System under Random Demand
title_full Production Scheduling in a Flexible Manufacturing System under Random Demand
title_fullStr Production Scheduling in a Flexible Manufacturing System under Random Demand
title_full_unstemmed Production Scheduling in a Flexible Manufacturing System under Random Demand
title_sort production scheduling in a flexible manufacturing system under random demand
publisher Institutional Knowledge at Singapore Management University
publishDate 2004
url https://ink.library.smu.edu.sg/lkcsb_research/887
https://doi.org/10.1016/s0377-2217(03)00300-x
_version_ 1770569739668553728