A Novel Ant Colony Algorithm for the Single-Machine Total Weighted Tardiness Problem with Sequence Dependent Setup Times

Ahmadizar, Fardin; Hosseini, Leila

doi:10.1080/18756891.2011.9727804

Cited by 9 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From the 120 problems 25 problems are randomly selected and the HCS algorithm is applied to the problems. Ahmadizar and Hosseini (2011) have also considered the similar problems. The results obtained by the improved CS algorithm are compared with other metaheuristics addressed in the literature (ACO, CS, GA, MA, PSO and SA).…”

Section: Evaluation Of Benchmark Problemsmentioning

confidence: 99%

“…The mathematical model for the single machine total weighted tardiness scheduling problems with sequence dependent setup time is presented below. The model is due to Ahmadizar and Hosseini (2011). The following assumptions are made in this work.…”

Section: Problem Definitionmentioning

confidence: 99%

“…Mahdavi Mazdeh et al (2010) proposed three heuristic algorithms based on TS. Recently, Ahmadizar and Hosseini (2011) have proposed an ACO algorithm for the SMTWT scheduling problems with sequence dependent setup times.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A hybrid cuckoo search metaheuristic algorithm for solving single machine total weighted tardiness scheduling problems with sequence dependent setup times

Marichelvam¹,

Mani²

2016

IJCCIA

View full text Add to dashboard Cite

Abstract:In this paper, we present a hybrid algorithm based on cuckoo search algorithm to solve the single machine total weighted tardiness (SMTWT) scheduling problems with sequence dependent setup times which have been proved to be strongly NP-hard. Three different dispatching rules are incorporated with the initial random solutions of the cuckoo search (CS) algorithm to improve the solution quality. Computational results show that the proposed algorithm is very competitive to many metaheuristic algorithms in the literature.Keywords: metaheuristics; cuckoo search; total weighted tardiness; NP-hard; scheduling.Reference to this paper should be made as follows: Marichelvam, M.K. and Geetha, M. (2016) 'A hybrid cuckoo search metaheuristic algorithm for solving single machine total weighted tardiness scheduling problems with sequence dependent setup times', Int.

show abstract

Section: Evaluation Of Benchmark Problemsmentioning

confidence: 99%

Section: Problem Definitionmentioning

confidence: 99%

See 1 more Smart Citation

A hybrid cuckoo search metaheuristic algorithm for solving single machine total weighted tardiness scheduling problems with sequence dependent setup times

Marichelvam¹,

Mani²

2016

IJCCIA

View full text Add to dashboard Cite

show abstract

“…Often there are contract penalties applied to the supplier for tardy jobs. The penalties are generally greater for strategic jobs and they are usually linear, i.e., penalty per unit time [14].…”

Section: Problem Statement and Formulationmentioning

confidence: 99%

A Novel Algorithm Based on Divide-and-Merge Strategy for Single Machine Scheduling

Wang

Yin²

2013

AISS

View full text Add to dashboard Cite

Many optimization problems in the industrial engineering world, particularly in manufacturing systems, are very complex in nature and difficult to solve by conventional optimization techniques. The use of formal approaches is frequently limited owing to the complexity of the models or algorithms. In this paper, a novel approach is proposed for large scale single machine weighted tardiness problems, which combine heuristic algorithm and divide-and-merge strategy. Given an instance of a scheduling problem, our method divides the problem into subproblems using a feasible solution as a basis; then ach subproblem is optimized and the solutions of subproblems are then merged to form a complete solution to the original problem. The aim of proposed method is to find good quality solution within a reasonable amount of computational time. We test our algorithm on big single machine total weighted tardiness problem, which is an NP-hard problem. The results show that the proposed approach have promising application to some traditional hard problems, especially to single machine weighted tardiness problem with big scale.

show abstract

Iterated population-based VND algorithms for single-machine scheduling with sequence-dependent setup times

Chen

2018

Soft Comput

View full text Add to dashboard Cite

A Novel Ant Colony Algorithm for the Single-Machine Total Weighted Tardiness Problem with Sequence Dependent Setup Times

Cited by 9 publications

References 15 publications

A hybrid cuckoo search metaheuristic algorithm for solving single machine total weighted tardiness scheduling problems with sequence dependent setup times

A hybrid cuckoo search metaheuristic algorithm for solving single machine total weighted tardiness scheduling problems with sequence dependent setup times

A Novel Algorithm Based on Divide-and-Merge Strategy for Single Machine Scheduling

Iterated population-based VND algorithms for single-machine scheduling with sequence-dependent setup times

Contact Info

Product

Resources

About