Multi-objective job shop scheduling problem with sequence dependent setup times using a novel metaheuristic. (1st January 2014)

• Record Type: Journal Article
• Authors: Khalili, Majid; Naderi, Bahman
• Is Part Of: International journal of intelligent engineering informatics. Volume 2: Number 4 (2014)
• Page Start: 243
• Page End: 258
• Publication Date: 2014-01-01
• Subjects: makespan -- total tardiness -- electromagnetism method -- job shop scheduling -- JSS -- sequence dependent setup times -- SDST; Artificial intelligence -- Engineering applications -- Periodicals; Engineering -- Computer programs -- Periodicals; Knowledge management -- Periodicals; 620.0028563
• DOI: 10.1504/IJIEI.2014.067146
• Languages: English
• ISSNs: 1758-8715

Abstract

The job shop problem is the most complicated and typical problem of all kinds of production scheduling problems, the allocation of resources over time to perform a collection of tasks. This paper studies multi-objective job shop scheduling problems where the setup times is sequence dependent to minimise two objective functions simultaneously. Since the problem is NP-hard and difficult to find an optimal solution in a reasonable computational time an efficient multi-objective electromagnetism algorithm (MOEA) is presented as the solution procedure. An electromagnetism algorithm is known as a flexible and effective population-based algorithm utilising an attraction/repulsion mechanism to move the particles towards optimality. The algorithm is carefully evaluated for its performance against two available algorithms by means of multi-objective performance measures and statistical tools. All the results demonstrate that our MOEA is very effective for the problem.