Job Shop Scheduling Problem with Job Sizes and Inventories

Shen Xinyi, Wang Aimin, Ge Yan, Ye Jieran

科研成果: 书/报告/会议事项章节会议稿件同行评审

2 引用 (Scopus)

摘要

In order to satisfy better the actual situation of modern manufacturing enterprise workshop scheduling and the need of lean production, this paper considers the job shop scheduling problem with inventories and batch size of each job. In this problem, for some jobs, if the inventory can meet the demand, no further processing is required. Therefore, the actual processing batch size of a job is its demand size minus the inventory size of the job. Job sizes influence the starting time of operations. With the objective of minimizing the makespan of all jobs, a mixed integer programming model is established. A genetic algorithm is used to solve the proposed model. Finally, a program was developed with the actual data, job sizes, inventories and the job sizes of starting operations to verify the feasibility and effectiveness of the algorithm. The result shows that the algorithm achieves satisfactory results in all indexes mentioned above.

源语言英语
主期刊名Proceedings of 2020 IEEE 11th International Conference on Mechanical and Intelligent Manufacturing Technologies, ICMIMT 2020
出版商Institute of Electrical and Electronics Engineers Inc.
202-206
页数5
ISBN(电子版)9781728153322
DOI
出版状态已出版 - 1月 2020
已对外发布
活动11th IEEE International Conference on Mechanical and Intelligent Manufacturing Technologies, ICMIMT 2020 - Cape Town, 南非
期限: 20 1月 202022 1月 2020

出版系列

姓名Proceedings of 2020 IEEE 11th International Conference on Mechanical and Intelligent Manufacturing Technologies, ICMIMT 2020

会议

会议11th IEEE International Conference on Mechanical and Intelligent Manufacturing Technologies, ICMIMT 2020
国家/地区南非
Cape Town
时期20/01/2022/01/20

指纹

探究 'Job Shop Scheduling Problem with Job Sizes and Inventories' 的科研主题。它们共同构成独一无二的指纹。

引用此