Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem

Author： Della Croce Federico   Grosso Andrea   Paschos Vangelis Th.  

Publisher： Springer Publishing Company

ISSN： 1094-6136

Source： Journal of Scheduling, Vol.7, Iss.1, 2004-01, pp. : 85-91

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM

By Nearchou Andreas C.  

Cybernetics and Systems, Vol. 43, Iss. 8, 2012-11 ,pp. : 651-668

Taylor & Francis Ltd

Access to resources Recommend Favorite

Lower bounds for on-line single-machine scheduling

By Epstein L.   van Stee R.  

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 439-450

Elsevier

Access to resources Recommend Favorite

Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date

By Lin Shih-Wei   Chou Shuo-Yan   Chen Shih-Chieh  

Journal of Heuristics, Vol. 13, Iss. 2, 2007-04 ,pp. : 151-165

Springer Publishing Company

Access to resources Recommend Favorite

Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming

By Ronconi Débora  

Journal of Scheduling, Vol. 13, Iss. 6, 2010-12 ,pp. : 597-607

Springer Publishing Company

Access to resources Recommend Favorite

Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups

By Bożejko Wojciech  

Journal of Intelligent Manufacturing, Vol. 21, Iss. 6, 2010-12 ,pp. : 777-785

Springer Publishing Company

Access to resources Recommend Favorite