Comparing mathematical and heuristic rules for solving single machine scheduling problem with release and due date constraints

Yong Zhan; Haitao Zhu; Yuguang Zhong
September 2014
Applied Mechanics & Materials;2014, Issue 630-642, p1707
Academic Journal
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.


Related Articles

  • Links organization for channel assignment in multi-radio wireless mesh networks. Cheng, Hongju; Xiong, Naixue; Yang, Laurence; Chen, Guolong; Zhuang, Xiaofang; Lee, Changhoon // Multimedia Tools & Applications;Jul2013, Vol. 65 Issue 2, p239 

    It is one key issue in the wireless mesh networks to provide various scenarios such as multimedia and applications. Links in the network can be organized and assigned to orthogonal channels so as to minimize the co-channel interference. In this paper we focus on the channel assignment problem...

  • Two-stage flow-shop scheduling problem with non-identical second stage assembly machines. Navaei, J.; Ghomi, S. M. T. Fatemi; Jolai, F.; Shiraqai, M. E.; Hidaji, H. // International Journal of Advanced Manufacturing Technology;Dec2013, Vol. 69 Issue 9-12, p2215 

    This paper addresses the two-stage assembly flow-shop problem (TSAFP) with multiple non-identical assembly machines in second stage with the objective function of makespan minimization. This problem is a generalization of previously proposed problems in TSAFP. Mathematical mixed-integer linear...

  • MILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints. Ramezanian, R. // International Journal of Applied Operational Research;Autumn2014, Vol. 4 Issue 4, p11 

    In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer...

  • Information channel diagrams: an approach for modelling information flows. Durugbo, Christopher; Hutabarat, Windo; Tiwari, Ashutosh; Alcock, Jeffrey // Journal of Intelligent Manufacturing;Oct2012, Vol. 23 Issue 5, p1959 

    In this article, the 'information channel diagram' (ICD) approach is introduced as a diagrammatical tool for modelling information flow during the delivery phase of organisations in which goods are deployed or delivered to customers. An initial review and evaluation of current tools for...

  • A Tabu Search Algorithm to Optimize the Scheduling Problem for the Polyamide Fiber Plants. Hui Jin; Gelan Yang // International Journal of Advancements in Computing Technology;Jan2013, Vol. 5 Issue 1, p627 

    The paper proposes a tabu search implementation to solve the multiproduct continuous manufacturing facilities scheduling problem with sequence dependent setup times. A real-world scheduling problem from the polyamide fiber plant is investigated. The problem is formulated as a mixed-integer...

  • Uplink Task Scheduling Model and Heuristic Algorithm of Satellite Navigation System. LONG Yunjun; WANG Pei; ZHANG Zhongshan; Chen Yingwu // Advances in Information Sciences & Service Sciences;Sep2012, Vol. 4 Issue 16, p363 

    In order to keep the service availability, continuity, and accuracy of satellite navigation system, the navigation data of the navigation constellation should be updated periodically. Ground facility should be assigned to contact with the satellite to support the navigation data update process....

  • Optimización de Recorridos para la Recolección de Residuos Infecciosos. Simón, Silvia; Demaldé, José; Hernández, José; Carnero, Mercedes // Información Tecnológica;2012, Vol. 23 Issue 4, p125 

    This paper describes a methodology to determine the optimal routes for the recollection of infectious waste in the city of Rio Cuarto in Argentina. The case can be formulated as a mixed integer linear programming problem and is classified as NP-hard. (non-deterministic polynomialtime hard). The...

  • The total adjustment cost problem: Applications, models, and solution algorithms. Kreter, Stefan; Rieck, Julia; Zimmermann, Jürgen // Journal of Scheduling;Apr2014, Vol. 17 Issue 2, p145 

    Resource leveling problems arise whenever it is expedient to reduce the fluctuations in resource utilization over time, while maintaining a prescribed project completion deadline. Several resource leveling objective functions may be defined, consideration of which results in well-balanced...

  • Stochastic Operating Room Scheduling for High-Volume Specialties Under Block Booking. Shylo, Oleg V.; Prokopyev, Oleg A.; Schaefer, Andrew J. // INFORMS Journal on Computing;Fall2013, Vol. 25 Issue 4, p682 

    Scheduling elective procedures in an operating suite is a formidable task because of competing performance metrics and uncertain surgery durations. In this paper, we present an optimization framework for batch scheduling within a block booking system that maximizes the expected utilization of...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics