Flexible job shop scheduling problem considering machine and order acceptance, transportation costs, and setup times

被引：0
作者：
Mohsen Ziaee
Javad Mortazavi
Mohsen Amra
机构：
[1] University of Bojnord,Department of Industrial Engineering
[2] South-Tehran Branch,Department of Industrial Engineering
[3] Islamic Azad University,undefined
来源：
Soft Computing | 2022年 / 26卷
关键词：
Flexible job shop; Scheduling; Machines and orders acceptance; Transportation costs; Setup times; Heuristic algorithm;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper, for the first time, studied a new extension of the flexible job shop scheduling problem by assuming the acceptance and rejection of machines and orders. The flexible job shop problem was extended to implement production without a factory in natural environments. Therefore, the mixed-integer linear programming (MILP) model was developed for this problem aiming to minimize total costs, including the fixed cost of machine selection, variable operational cost, transportation cost, and order rejection cost. Due to the high complexity of this problem, a heuristic algorithm was employed to find an acceptable solution. For algorithm performance evaluation, 40 samples were randomly generated and solved using the mathematical model and the proposed algorithm. The results of analyzing random samples showed a negligible error rate indicating algorithm efficiency.
引用
收藏
页码：3527 / 3543
页数：16
相关论文
共 86 条
[1]  
Ahmadi-Javid A(2017)Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: A mathematical formulation and an Anarchic Society Optimization algorithm Computers Oper Res 84 73-91
[2]  
Hooshangi-Tabrizi P(2014)Parallel machine selection and job scheduling to minimize sum of machine holding cost, total machine time costs, and total tardiness costs IEEE Transactions Automation Sci Eng 11 294-301
[3]  
Alidaee B(2011)Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—variable neighborhood search approach J Manuf Syst 30 8-15
[4]  
Li H(2010)An artificial immune algorithm for the flexible job-shop scheduling problem Future Gener Computer Syst 26 533-541
[5]  
Bagheri A(2000)Multiprocessor scheduling with rejection SIAM J Discrete Math 13 64-78
[6]  
Zandieh M(1993)Routing and scheduling in a flexible job shop by tabu search Ann Oper Res 41 157-183
[7]  
Bagheri A(1990)Job-shop scheduling with multi-purpose machines Computing 45 369-375
[8]  
Zandieh M(2005)Parallel machine selection and job scheduling to minimize machine cost and job tardiness Computers Oper Res 32 1995-2012
[9]  
Mahdavi I(1997)An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search Ann Oper Res 70 281-306
[10]  
Yazdani M(2013)Evaluation of mathematical models for flexible job-shop scheduling problems Appl Math Model 37 977-988
123456789