CONTINUOUS-FLOW MODELS FOR BATCH MANUFACTURING - A BASIS FOR A HIERARCHICAL APPROACH

被引:10
作者
BRANDIMARTE, P
UKOVICH, W
VILLA, A
机构
[1] Dipartimento di Sistemi di Produzione ed Economia dell’Azienda, Politecnico di Torino, Torino, 10129
[2] Dipartimento di Elettrotecnica, Elettronica e Informatica, Università di Trieste, Trieste, 34127, Via A
关键词
D O I
10.1080/00207549508930233
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper we propose approximate dynamic models, based on continuous material flows, in order to overcome the difficulties usually faced by classical machine scheduling methods, such as computational complexity, limited ability to model all the features of real manufacturing environments and to cope with unpredictable events. The continuous flow approach, which has been often proposed for repetitive manufacturing environments, is exploited here for a batch manufacturing environment; a multi-stage case is used to illustrate the methodology. Both discrete and continuous time dynamic models are considered. Some computational complexity results are given for the resulting optimization problems. Based on these models, a two-level hierarchical approach is proposed: the task of the upper hierarchical level is to solve the continuous flow scheduling problem, yielding a reference production trajectory; the task of the lower level is detail scheduling, aimed at meeting the production targets set by the upper level. Constraints may be added to the continuous flow model in order to cope with unfeasibilities detected by the lower level, resulting in a two-way hierarchical scheme.
引用
收藏
页码:1635 / 1660
页数:26
相关论文
共 42 条
[1]  
Akella R., Choong Y., Gershwin S.B., Performance of hierarchical production scheduling policy, IEEE Transactions on Components, Hybrids and Manufacturing Technology, pp. 225-240, (1984)
[2]  
Adams J., Balas E., Zawack D., The shifting bottleneck procedure for job shop scheduling, Management Science, 34, pp. 391-401, (1988)
[3]  
Barnes J.W., Laguna M., A Tabu Search experience in production scheduling, Annals of Operations Research, 41, pp. 141-156, (1993)
[4]  
Bertrand J., Wortmann J.C., Wungaard J., Production Control: A Structural and Design Oriented Approach, (1990)
[5]  
Blazewicz J., Cellary W., Slowinski R., Weglarz J., Scheduling under resource constraints-e-deterministic models, Annals of Operations Research, 7, (1986)
[6]  
Brah S.A., Hunsucker J., Branch and bound algorithm for the flow shop with multiple processors, European Journal of Operational Research, 51, pp. 88-99, (1991)
[7]  
Brandimarte P., Routeing and scheduling in a flexible job shop by Tabu Search, Annals of Operations Research, 41, pp. 157-183, (1993)
[8]  
Browne J., Harhen J., Shivnan J., Production Management Systems-A CIM Perspective, (1988)
[9]  
Caramanis M., Sharifnia A., Near optimal manufacturing flow controller design, International Journal of Flexible Manufacturing Systems, 3, pp. 321-336, (1991)
[10]  
Chang S.-C., Liao D.-Y., Hsieh F.-S., Scheduling flexible flow shops of no setup cost by a lagrangian relaxation and network reformulation approach, Proceedings of the 1991 IEEE International Conference on Robotics and Automation, pp. 1054-1059, (1991)