A theoretical development for the total tardiness problem and its application in branch and bound algorithms

Zhou, Shuyu; Liu, Zhaohui

doi:10.1016/j.cor.2012.06.005

Search citation statements

Order By: Relevance

Paper Sections

Select...

A Single Machine Total Weighted Tardiness Scheduling Problems1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Abdul-Razaq et al [4] presented a comprehensive survey on the various methodologies proposed to solve the SMTWTSP until 1990s. Many researchers proposed Branch & Bound algorithm [5][6][7] to solve the SMTWTSP. Potts and Van Wassenhove [8] addressed several heuristics to solve the SMTWTSP.…”

Section: A Single Machine Total Weighted Tardiness Scheduling Problemsmentioning

confidence: 99%

A modified elephant herd optimization algorithm to solve the single machine scheduling problems

Marichelvam¹,

Mani²

2019

IJEAT

View full text Add to dashboard Cite

This study reports the single machine scheduling problem for finding the minimum the total weighted tardiness. As the problem is non-deterministic polynomial-time hard (NP-hard), the problem might not be answered by the exact solution techniques. Henceforth, different heuristics and meta-heuristics were recommended by different practitioners to tackle the problem. A modified elephant herd optimization algorithm (MEHOA) is investigated in the present work to solve the single machine total weighted tardiness scheduling problem (SMTWTSP). The performance of the anticipated approach is studied with the test instances available in the OR library. The outcomes are compared with several different algorithms offered in the literature and indicate the efficacy of the developed methodology.

show abstract

Section: A Single Machine Total Weighted Tardiness Scheduling Problemsmentioning

confidence: 99%

A modified elephant herd optimization algorithm to solve the single machine scheduling problems

Marichelvam¹,

Mani²

2019

IJEAT

View full text Add to dashboard Cite

show abstract

A theoretical development for the total tardiness problem and its application in branch and bound algorithms

Cited by 1 publication

References 22 publications

A modified elephant herd optimization algorithm to solve the single machine scheduling problems

A modified elephant herd optimization algorithm to solve the single machine scheduling problems

Contact Info

Product

Resources

About