Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags

1996 ◽  
Vol 9 (3-4) ◽  
pp. 239-253 ◽  
Author(s):  
Jatinder N. D. Gupta
Keyword(s):  
Single Machine ◽  
Comparative Evaluation ◽  
Heuristic Algorithms ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Time Lags ◽  
Scheduling Problem

An Equilibrium Principle on the AON Network for Single-Machine Scheduling Problem with Time Lags

2010 ◽  
Vol 44-47 ◽  
pp. 3692-3696
Author(s):  
Chun Yue Yu ◽  
Xiao Chuan Luo
Keyword(s):  
Single Machine ◽  
Hot Rolling ◽  
Rolling Mill ◽  
Completion Time ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Time Lags ◽  
Scheduling Problem ◽  
Testing Problem ◽  
Node Network

The NP-hard single-machine scheduling problem with time lags while minimizing the completion time could be described with an AON (Activity-On-Node) network. An equilibrium principle was discovered and proved on the AON network for single-machine scheduling problem. As a testing problem, plate hot rolling scheduling is a type of single-machine scheduling problem with time lags. For the scheduling problem, a nonlinear mathematic optimization model, which maximizes utilization of the rolling mill, was established based on the equilibrium principle and was solved by software LINGO. Computation examples demonstrated that the new method could solve effectively the single-machine scheduling problem with time lags by equilibrium principle on the AON network.

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.

BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS

2009 ◽  
Vol 26 (03) ◽  
pp. 319-339 ◽  
Author(s):  
JORGE M. S. VALENTE
Keyword(s):  
Single Machine ◽  
Heuristic Algorithms ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Medium Size ◽  
Scheduling Problem ◽  
Beam Search ◽  
Evaluation Functions ◽  
Search Heuristics ◽  
Objective Function Values

In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We present heuristic algorithms based on the beam search technique. These algorithms include classic beam search procedures, as well as the filtered and recovering variants. Several dispatching rules are considered as evaluation functions, to analyze the effect of different rules on the effectiveness of the beam search algorithms. The computational results show that using better rules improves the performance of the beam search heuristics. The detailed, filtered beam search (FBS) and recovering beam search (RBS) procedures outperform the best existing heuristic. The best results are given by the recovering and detailed variants, which provide objective function values that are quite close to the optimum. For small to medium size instances, either of these procedures can be used. For larger instances, the detailed beam search (DBS) algorithm requires excessive computation times, and the RBS procedure then becomes the heuristic of choice.

Sign in / Sign up

Export Citation Format

Share Document