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

Yong Zhan; Hai Tao Zhu; Yu Guang Zhong

doi:10.4028/www.scientific.net/AMM.635-637.1707

Paper Titles

AGROTOOL Software as an Intellectual Core of Decision Support Systems in Computer Aided Agriculture
p.1688

Analysis and Simulation of Binary Search Algorithm
p.1692

Application of Grey Model Theory to Forecast Flight Training Time
p.1696

Comparison of Genetic Algorithm and Determinant Method on Solving a System of Linear Equations
p.1700

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

Design and Application of Digital Tourism Platform
p.1711

Intelligent Identification of Flow Regime Based on a Novel Neural Network
p.1715

Internet System for Mathematics Reading and Fuzzy Clustering Analysis for Students
p.1719

Local Outlier Detection Algorithm Based on Coefficient of Variation
p.1723

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 635-637Comparing Mathematical and Heuristic Rules for...

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

Abstract:

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.