The University of Southampton
University of Southampton Institutional Repository

JIT single machine scheduling problem with periodic preventive maintenance

JIT single machine scheduling problem with periodic preventive maintenance
JIT single machine scheduling problem with periodic preventive maintenance
This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, multi-objective particle swarm optimization (MOPSO) algorithm is implemented. Also, as well as MOPSO, two other optimization algorithms are used for comparing the results. Eventually, Taguchi method with metrics analysis is presented to tune the algorithms’ parameters and a multiple criterion decision making technique based on the technique for order of preference by similarity to ideal solution is applied to choose the best algorithm. Comparison results confirmed the supremacy of MOPSO to the other algorithms.
MCDM, Multi-objective optimization, Periodic maintenance, Scheduling, Single machine, Total earliness-tardiness
2251-712X
299-310
Shahriari, Mohammadreza
2adfbb13-196a-4ac3-964e-e07ae89f2469
Shoja, Naghi
20b8ea51-2032-4a87-b8f7-3df5bfc9c215
Zade, Amir Ebrahimi
21fb69bf-388b-440b-85a1-6399b0b70f0b
Barak, Sasan
f82186de-f5b7-4224-9621-a00e7501f2c3
Sharifi, Mani
53421466-7729-4956-880e-9cca21db7ef1
Shahriari, Mohammadreza
2adfbb13-196a-4ac3-964e-e07ae89f2469
Shoja, Naghi
20b8ea51-2032-4a87-b8f7-3df5bfc9c215
Zade, Amir Ebrahimi
21fb69bf-388b-440b-85a1-6399b0b70f0b
Barak, Sasan
f82186de-f5b7-4224-9621-a00e7501f2c3
Sharifi, Mani
53421466-7729-4956-880e-9cca21db7ef1

Shahriari, Mohammadreza, Shoja, Naghi, Zade, Amir Ebrahimi, Barak, Sasan and Sharifi, Mani (2016) JIT single machine scheduling problem with periodic preventive maintenance. Journal of Industrial Engineering International, 12 (3), 299-310. (doi:10.1007/s40092-016-0147-9).

Record type: Article

Abstract

This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, multi-objective particle swarm optimization (MOPSO) algorithm is implemented. Also, as well as MOPSO, two other optimization algorithms are used for comparing the results. Eventually, Taguchi method with metrics analysis is presented to tune the algorithms’ parameters and a multiple criterion decision making technique based on the technique for order of preference by similarity to ideal solution is applied to choose the best algorithm. Comparison results confirmed the supremacy of MOPSO to the other algorithms.

Full text not available from this repository.

More information

Accepted/In Press date: 26 February 2016
e-pub ahead of print date: 15 March 2016
Published date: 1 September 2016
Keywords: MCDM, Multi-objective optimization, Periodic maintenance, Scheduling, Single machine, Total earliness-tardiness

Identifiers

Local EPrints ID: 434849
URI: https://eprints.soton.ac.uk/id/eprint/434849
ISSN: 2251-712X
PURE UUID: ca246af9-7d56-490c-a897-4dd7935946af
ORCID for Sasan Barak: ORCID iD orcid.org/0000-0001-7715-9958

Catalogue record

Date deposited: 11 Oct 2019 16:30
Last modified: 03 Dec 2019 01:20

Export record

Altmetrics

Contributors

Author: Mohammadreza Shahriari
Author: Naghi Shoja
Author: Amir Ebrahimi Zade
Author: Sasan Barak ORCID iD
Author: Mani Sharifi

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×