unrelated parallel machine scheduling problem considering workin-progress and finished goods inventories subject to resource constraints and due dates: a simulated annealing algorithm

In this paper, we studied a real-world example of an unrelated parallel machine scheduling problem in which the just-in-time (jit) inventory system, including work-in-process and finished goods inventories, is the center of interest. the presented simulated annealing algorithm tackling the combinatorial problem is a part of the expert and intelligent production system that assists a decision maker in perceiving his/her decision’s outcome in advance. precisely noted, the problem statement is novel since the integration of inventory systems, and renewable and non-renewable resources engaged in manufacturing are taken into account. the undertaken manufacturing system could be attributed to the direct influence of the management strategy of the jit inventory system not only to reduce the inventory level but also to minimize the earliness and tardiness cost responding to due dates. moreover, the conventional parameters are reflected in the problem description and solution methodology. in conclusion, the results are remarkable in two terms, the first is to obtain a better production planning in considerably less time, and secondly, a cost-benefit analysis tool to contrast the jit approach with the earliest possible completion time criterion. finally, possible research directions are suggested for future studies.