A production scheduling problem with uncertain sequence-dependent set-up times and random yield

Byung Jun Joo, Paul Xirouchakis

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

A scheduling problem in a real production line with uncertain sequence-dependent set-up times and a random yield is considered. The production line can produce multiple product types as production lots, each of which is composed of a number of products of the same product type. To changeover product types, a sequence-dependent set-up operation should be performed, and only the lower and upper bounds are known for the sequence-dependent set-up times. Moreover, the processing time to produce the required number of product for each production lot is uncertain due to the random yield. For the objective of minimising the average tardy probability of given production lots, a systematic approximation scheme to estimate tardy probabilities of lots in any given production sequence is developed by taking not only the uncertainties but also the computational ef fi ciency into account. As practical solution approaches, a simulated annealing and a discrete particle swarm optimisation algorithms using the approximation scheme are developed, and their performance are evaluated by computational experiments. Since there has been no research on the scheduling problems with uncertain sequence-dependent set-up times and random yield, the authors expect this research will make
an excellent contribution to develop practical scheduling methodologies in uncertain scheduling environments.
LanguageEnglish
Pages2820-2835
Number of pages16
JournalInternational Journal of Production Research
Volume53
Issue number9
DOIs
Publication statusPublished - 13 Jan 2015

Fingerprint

Scheduling
Simulated annealing
Particle swarm optimization (PSO)
Random yield
Sequence-dependent setup times
Production/scheduling
Processing
Production line
Approximation
Experiments

Keywords

  • scheduling
  • sequence dependent set up
  • random yield
  • meta heuristics
  • simulated annealing
  • particle swarm optimisation

Cite this

@article{613f3a3074804fa3aea363e0f766ef1c,
title = "A production scheduling problem with uncertain sequence-dependent set-up times and random yield",
abstract = "A scheduling problem in a real production line with uncertain sequence-dependent set-up times and a random yield is considered. The production line can produce multiple product types as production lots, each of which is composed of a number of products of the same product type. To changeover product types, a sequence-dependent set-up operation should be performed, and only the lower and upper bounds are known for the sequence-dependent set-up times. Moreover, the processing time to produce the required number of product for each production lot is uncertain due to the random yield. For the objective of minimising the average tardy probability of given production lots, a systematic approximation scheme to estimate tardy probabilities of lots in any given production sequence is developed by taking not only the uncertainties but also the computational ef fi ciency into account. As practical solution approaches, a simulated annealing and a discrete particle swarm optimisation algorithms using the approximation scheme are developed, and their performance are evaluated by computational experiments. Since there has been no research on the scheduling problems with uncertain sequence-dependent set-up times and random yield, the authors expect this research will makean excellent contribution to develop practical scheduling methodologies in uncertain scheduling environments.",
keywords = "scheduling, sequence dependent set up, random yield, meta heuristics, simulated annealing, particle swarm optimisation",
author = "Joo, {Byung Jun} and Paul Xirouchakis",
year = "2015",
month = "1",
day = "13",
doi = "10.1080/00207543.2014.998790",
language = "English",
volume = "53",
pages = "2820--2835",
journal = "International Journal of Production Research",
issn = "0020-7543",
number = "9",

}

A production scheduling problem with uncertain sequence-dependent set-up times and random yield. / Joo, Byung Jun; Xirouchakis, Paul.

In: International Journal of Production Research, Vol. 53, No. 9, 13.01.2015, p. 2820-2835.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A production scheduling problem with uncertain sequence-dependent set-up times and random yield

AU - Joo, Byung Jun

AU - Xirouchakis, Paul

PY - 2015/1/13

Y1 - 2015/1/13

N2 - A scheduling problem in a real production line with uncertain sequence-dependent set-up times and a random yield is considered. The production line can produce multiple product types as production lots, each of which is composed of a number of products of the same product type. To changeover product types, a sequence-dependent set-up operation should be performed, and only the lower and upper bounds are known for the sequence-dependent set-up times. Moreover, the processing time to produce the required number of product for each production lot is uncertain due to the random yield. For the objective of minimising the average tardy probability of given production lots, a systematic approximation scheme to estimate tardy probabilities of lots in any given production sequence is developed by taking not only the uncertainties but also the computational ef fi ciency into account. As practical solution approaches, a simulated annealing and a discrete particle swarm optimisation algorithms using the approximation scheme are developed, and their performance are evaluated by computational experiments. Since there has been no research on the scheduling problems with uncertain sequence-dependent set-up times and random yield, the authors expect this research will makean excellent contribution to develop practical scheduling methodologies in uncertain scheduling environments.

AB - A scheduling problem in a real production line with uncertain sequence-dependent set-up times and a random yield is considered. The production line can produce multiple product types as production lots, each of which is composed of a number of products of the same product type. To changeover product types, a sequence-dependent set-up operation should be performed, and only the lower and upper bounds are known for the sequence-dependent set-up times. Moreover, the processing time to produce the required number of product for each production lot is uncertain due to the random yield. For the objective of minimising the average tardy probability of given production lots, a systematic approximation scheme to estimate tardy probabilities of lots in any given production sequence is developed by taking not only the uncertainties but also the computational ef fi ciency into account. As practical solution approaches, a simulated annealing and a discrete particle swarm optimisation algorithms using the approximation scheme are developed, and their performance are evaluated by computational experiments. Since there has been no research on the scheduling problems with uncertain sequence-dependent set-up times and random yield, the authors expect this research will makean excellent contribution to develop practical scheduling methodologies in uncertain scheduling environments.

KW - scheduling

KW - sequence dependent set up

KW - random yield

KW - meta heuristics

KW - simulated annealing

KW - particle swarm optimisation

U2 - 10.1080/00207543.2014.998790

DO - 10.1080/00207543.2014.998790

M3 - Article

VL - 53

SP - 2820

EP - 2835

JO - International Journal of Production Research

T2 - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 9

ER -