A new lower bound for the makespan of a single machine scheduling problem

2007 ◽  
pp. 209-218
Author(s):  
G. Tinhofer ◽  
E. Farnbacher
Keyword(s):  
Lower Bound ◽  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem

scholarly journals Single-machine Scheduling with Splitable Jobs and Availability Constraints

2013 ◽  
Vol 3 (1-2) ◽  
Author(s):  
Van Huy Nguyen ◽  
Nguyen Huynh Tuong ◽  
Hua Phung Nguyen ◽  
Thanh Hien Nguyen
Keyword(s):  
Lower Bound ◽  
Single Machine ◽  
Heuristic Algorithms ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Strong Sense ◽  
Scheduling Problem ◽  
Computational Results ◽  
Feasible Schedule ◽  
Availability Constraints

This paper deals with a single machine scheduling problem with availability constraints. The jobs are splitable and lower bound on the size of each sub-job is imposed. The objective is to find a feasible schedule that minimizes the makespan. The proposed scheduling problem is proved to be NP-hard in the strong sense. Some effective heuristic algorithms are then proposed. Additionally, computational results show that the proposed heuristic performs well.

Sign in / Sign up

Export Citation Format

Share Document