Home > A production scheduling problem with uncertain sequence-dependent set-up times and random yield > HTML MARC |

000207259 001__ 207259 000207259 005__ 20180913063053.0 000207259 0247_ $$2doi$$a10.1080/00207543.2014.998790 000207259 022__ $$a0020-7543 000207259 02470 $$2ISI$$a000350451200016 000207259 037__ $$aARTICLE 000207259 245__ $$aA production scheduling problem with uncertain sequence-dependent set-up times and random yield 000207259 260__ $$aAbingdon$$bTaylor & Francis Ltd$$c2015 000207259 269__ $$a2015 000207259 300__ $$a16 000207259 336__ $$aJournal Articles 000207259 520__ $$aA 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 efficiency 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. 000207259 6531_ $$asimulated annealing 000207259 6531_ $$asequence-dependent set-up 000207259 6531_ $$aparticle swarm optimisation 000207259 6531_ $$ascheduling 000207259 6531_ $$ameta-heuristics 000207259 6531_ $$arandom yield 000207259 700__ $$0246104$$aJoo, Byung Jun$$g220982 000207259 700__ $$0243953$$aXirouchakis, Paul$$g107556 000207259 773__ $$j53$$k9$$q2820-2835$$tInternational Journal Of Production Research 000207259 909C0 $$0252295$$pLICP$$xU10361 000207259 909CO $$ooai:infoscience.tind.io:207259$$particle 000207259 917Z8 $$x207133 000207259 937__ $$aEPFL-ARTICLE-207259 000207259 973__ $$aEPFL$$rREVIEWED$$sPUBLISHED 000207259 980__ $$aARTICLE