This paper considers single machine due-window assignment scheduling problems with position-dependent weights. Under the learning and deterioration effects of jobs processing times, our goal is to minimize weighted sum earliness-tardiness, starting time due-window, size, where weights only depends on their position in a sequence (i.e., weights). common (CONW), slack (SLKW) different (DIFW) assi...

We propose a problem space genetic algorithm to solve single machine total weighted tardiness scheduling problems. The proposed algorithm utilizes global and time-dependent local dominance rules to improve the neighborhood structure of the search space. They are also a powerful exploitation (intensifying) tool since the global optimum is one of the local optimum solutions. Furthermore, the prob...

A single machine scheduling problem is described which covers earliness costs, tardiness costs and setup costs. Setups are needed whenever a switch is made to a job of another product family. All jobs within the same product family have the same processing time. Besides setup costs also setup times are involved. Idle time is allowed, preemption is not allowed. Both a mixed integer programming f...

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 ...