Comparing Mathematical and Heuristic Rules for Solving Single Machine Scheduling Problem with Release and due Date Constraints

2014 ◽  
Vol 635-637 ◽  
pp. 1707-1710
Author(s):  
Yong Zhan ◽  
Hai Tao Zhu ◽  
Yu Guang Zhong
Keyword(s):  
Single Machine ◽  
Numerical Experiments ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Heuristic Rules ◽  
Due Date ◽  
Mip Model ◽  
Accuracy Of Results

The purpose of this paper is to compare a mixed integer programming (MIP) model, and heuristic rules based on their practical efficiency and the accuracy of results to tackle the minimum lateness single machine scheduling problem with release and due date constraints. Extensive numerical experiments are carried out on randomly generated testing instances in order to evaluate the performance of the MIP model and heuristic rules.

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 Improved Approaches to Minimize the Makespan on Single-Machine Scheduling with Periodic Preventive Maintenance Activities

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Hongming Zhou ◽  
Ya-Chih Tsai ◽  
Ful-Chiang Wu ◽  
Shenquan Huang ◽  
Fuh-Der Chou
Keyword(s):  
Single Machine ◽  
Preventive Maintenance ◽  
Bin Packing ◽  
Heuristic Algorithms ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Mixed Integer ◽  
Mip Model ◽  
Periodic Preventive Maintenance ◽  
Maintenance Activities

This paper addresses a single-machine scheduling problem with periodic preventive maintenance activities that are predeterministic so that the machine is not available all the time, and jobs have to be processed between two consecutive maintenance periods. We propose a mixed integer programming (MIP) model and two heuristics to minimize the makespan. With more constraints in our model, the model is more efficient than the recent model of Perez-Gonzalez and Framinan , and our model could solve problems with up to fifty jobs. Two heuristic algorithms, namely, H (MW) and H (LB∗), are also proposed, in which two bin-packing policies of the minimum waste and minimum lower bound are used, respectively. Furthermore, we also proposed an improvement procedure. The results showed that the heuristic H (MW) outperformed other heuristics of the paper, indicating that the bin-packing policy of the minimum waste is more effective than well-known ones such as full batch and best fit. Additionally, all the heuristic algorithms addressed in this paper combined with the improvement procedure could achieve a similar and high quality of solutions with a very tiny increase in computational expense.

Sign in / Sign up

Export Citation Format

Share Document