The unrelated parallel machine scheduling (PMS) problem is essential for the manufacturing industry. Scheduling will save company resources, especially time management. By solving problems quickly and precisely, can get more profit. On that note, this paper focused on PMS problems, which did not consider inherent uncertainty in processing set up by minimizing makespan tardiness. This aimed to m...

We consider a fundamental online scheduling problem in which jobs with processing times and deadlines arrive over time at their release dates. The task is to determine feasible preemptive schedule on single or multiple possibly unrelated machines that maximizes the number of complete before deadline. Due strong impossibility results for competitive analysis machine, we require contain some slac...

Scheduling has become an attractive area for artificial intelligence researchers. On other hand, in today's real-world manufacturing systems, the importance of an efficient maintenance schedule program cannot be ignored because it plays an important role in the success of manufacturing facilities. A maintenance program may be considered as the heath care of manufacturing machines and equipments...

The unrelated parallel machine scheduling problem aims to assign jobs independent machines with sequence-dependent setup times so that the makespan is minimized. When many practical considerations are introduced, solving resulting challenging, especially when problems of realistic sizes interest. In this study, in addition conventional objective minimizing makespan, we further consider burn-in ...

Abstract In many applications in the context of patient appointment scheduling there are recurring tasks with fixed delays between them. These commonly referred to as coupled-task jobs. settings, each job consists two whereby second task must start processing after an exact time lag following completion first task. this paper, we introduce problem a set jobs on parallel identical machines objec...