![]() ![]() More specifically, we show that FlexMISMA is at least as hard as MISMA. In this paper, we determine a tight classification of conditions that are required for obtaining a polynomial time algorithm for both MISMA and FlexMISMA. This motivates a variant of MISMA where the end times of the machines’ availability intervals can be permuted, the Flexible Multithread ISMA (FlexMISMA). The time slots for maintenance at the end of a processing period are often predetermined by staff schedules before the slots are assigned to specific machines. In machine scheduling, maintenance plays a crucial role in guaranteeing an efficient operation. ![]() We extend ISMA by introducing machine capacities to model parallel processing of multiple jobs per machine: the Multi-thread Interval Scheduling with Machine Availabilities (MISMA). ![]() The objective is to schedule all jobs such that the machines’ availability intervals are respected or to decide that there exists no such schedule. In the known Interval Scheduling Problem with Machine Availabilities (ISMA), each machine has a contiguous availability interval and each job has a specific time interval which has to be scheduled. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |