scholarly journals An Exact Method and Ant Colony Optimization for Single Machine Scheduling Problem With Time Window Periodic Maintenance

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 44836-44845 ◽  
Author(s):  
Ammar A. Qamhan ◽  
Aref Ahmed ◽  
Ibrahim M. Al-Harkan ◽  
Ahmed Badwelan ◽  
Ali M. Al-Samhan ◽  
...  
Keyword(s):  
Ant Colony Optimization ◽  
Single Machine ◽  
Time Window ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Ant Colony ◽  
Exact Method ◽  
Scheduling Problem ◽  
Periodic Maintenance

scholarly journals Single-Machine Scheduling with Workload-Dependent Maintenance Duration to Minimize Maximum Lateness

2015 ◽  
Vol 2015 ◽  
pp. 1-5 ◽  
Author(s):  
Ting Wang ◽  
Dehua Xu
Keyword(s):  
Single Machine ◽  
Time Window ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Maximum Lateness ◽  
Scheduling Problem ◽  
Due Date ◽  
Start Time ◽  
Tight Bound ◽  
Special Cases

A single-machine scheduling problem with a mandatory maintenance whose duration is workload-dependent is considered. The start time of the maintenance is restricted to a time window. The objective is to determine the start time of the maintenance and schedule all the jobs to the machine such that the maximum lateness is minimized. An approximation algorithm based on the classical Earliest Due Date first rule is proposed. It is showed that the proposed algorithm is optimal for some special cases and that it has a tight bound for the scheduling problem under consideration.

scholarly journals A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance

2019 ◽  
Vol 53 (1) ◽  
pp. 289-302 ◽  
Author(s):  
Hanane Krim ◽  
Rachid Benmansour ◽  
David Duvivier ◽  
Abdelhakim Artiba
Keyword(s):  
Single Machine ◽  
Variable Neighborhood Search ◽  
Search Algorithm ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Computational Time ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Periodic Maintenance ◽  
Neighborhood Search Algorithm

In this paper we propose to solve a single machine scheduling problem which has to undergo a periodic preventive maintenance. The objective is to minimize the weighted sum of the completion times. This criterion is defined as one of the most important objectives in practice but has not been studied so far for the considered problem. As the problem is proven to be NP-hard, and a mathematical model is proposed in the literature, we propose to use General Variable Neighborhood Search algorithm to solve this problem in order to obtain near optimal solutions for the large-sized instances in a small amount of computational time.

Sign in / Sign up

Export Citation Format

Share Document