Abstract: Research on due date oriented objectives in the parallel machine environment is at best scarce compared to objectives such as minimizing the makespan or the completion time related performance measures. Moreover, almost all existing work in this area is focused on the identical parallel machine environment. In this study, we leverage on our previous work on the single machine total we...

Customer profiles have rapidly changed over the past few years, with products being requested more customization and lower demand. In addition to advances in technologies owing Industry 4.0, manufacturers explore autonomous smart factories. This paper proposes a decentralized multi-agent system (MAS), including intelligent agents that can respond their environment autonomously through learning ...

Parallel machine scheduling with sequence-dependent family setups has attracted much attention from academia and industry due to its practical applications. In a real-world manufacturing system, however, solving the problem becomes challenging since it is required address urgent frequent changes in demand due-dates of products. To minimize total tardiness problem, we propose deep reinforcement ...

The single machine total weighted tardiness with release dates problem is known to be strongly NP-hard. With a new lower bounding scheme and a new upper bounding scheme, we get an efficient branch and bound algorithm. In the paper, we first introduce the history of the problem and its computational complexity. Second, the lower bounding schemes and the upper bounding schemes are described in de...