An iterative lower bound algorithm for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization

2014 ◽  
Author(s):  
Walid Hfaiedh ◽  
Cherif Sadfi ◽  
Imed Kacem ◽  
Atidel B. Hadj-Alouane
Keyword(s):  
Lower Bound ◽  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Delivery Time ◽  
Availability Constraint ◽  
Time Minimization

scholarly journals An exact block algorithm for no-idle RPQ problem

2017 ◽  
Vol 27 (2) ◽  
pp. 323-330
Author(s):  
Jaroslaw Pempera
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Idle Time ◽  
Scheduling Problem ◽  
Delivery Time ◽  
Block Algorithm

Abstract In the work a single-machine scheduling problem is being considered, in which all tasks have a fixed availability (release) and delivery time. In the analyzed variant no-idle time is allowed on a machine. The purpose of optimization is to determine such order of tasks that minimizes the makespan, i.e. the time of execution of all the tasks. There is also a number of properties of the problem presented, in particular there are formulated block eliminating properties for no-idle constraint. There was an exact B&B algorithm based on the block properties proposed.

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