Development of lower bounds for the scheduling of setup tasks in serial production lines

Name: Development of lower bounds for the scheduling of setup tasks in serial production lines
Author: Pessan, C., Neron, E., Haouari, Mohamed

İsim	Development of lower bounds for the scheduling of setup tasks in serial production lines
Yazar	Pessan, C., Neron, E., Haouari, Mohamed
Basım Tarihi:	2013
Basım Yeri	- Inderscience Publishers
Konu	Parallel machine scheduling, Lower bounds, Production resetting, Revisited energetic reasoning, Setup tasks, Serial production lines, Production flexibility, Setup time reduction, Ball bearings, Preemptive relaxation, Ball bearing manufacture
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	1751-5262
Kayıt Numarası	78cb4737-4b8b-499d-aa55-b8b9bb931bad
Lokasyon	Industrial Engineering
Tarih	2013
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	Efficient production resettings are necessary to achieve production flexibility. For this reason, it is of primary importance to reduce the setup time required to switch the production from one product type to another, and more generally to minimise the loss of production during these resetting phases. In this paper, we investigate the problem of scheduling operations within a production resetting that arises at the ball bearing factories of the SKF group. In the case of full serial production lines, improving the setup times amount to minimising the time spent prior to restarting production. We show that the problem of scheduling operations within a production resetting can be modelled as an unrelated parallel machine scheduling problem, and we propose several lower bounds. The first one is an extension of the improved energetic reasoning to the unrelated parallel machine problem. The second one is based on a preemptive relaxation that includes valid inequalities. We report the results of computational experiments that were carried out on both industrial and generated instances and that provide evidence of the efficacy of the proposed lower bounds.
DOI	10.1504/EJIE.2013.057383
Cilt	7

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Development of lower bounds for the scheduling of setup tasks in serial production lines

Yazar Pessan, C., Neron, E., Haouari, Mohamed

Basım Tarihi 2013

Basım Yeri - Inderscience Publishers

Konu Parallel machine scheduling, Lower bounds, Production resetting, Revisited energetic reasoning, Setup tasks, Serial production lines, Production flexibility, Setup time reduction, Ball bearings, Preemptive relaxation, Ball bearing manufacture

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 1751-5262

Kayıt Numarası 78cb4737-4b8b-499d-aa55-b8b9bb931bad

Lokasyon Industrial Engineering

Tarih 2013

Notlar Due to copyright restrictions, the access to the full text of this article is only available via subscription.

Örnek Metin Efficient production resettings are necessary to achieve production flexibility. For this reason, it is of primary importance to reduce the setup time required to switch the production from one product type to another, and more generally to minimise the loss of production during these resetting phases. In this paper, we investigate the problem of scheduling operations within a production resetting that arises at the ball bearing factories of the SKF group. In the case of full serial production lines, improving the setup times amount to minimising the time spent prior to restarting production. We show that the problem of scheduling operations within a production resetting can be modelled as an unrelated parallel machine scheduling problem, and we propose several lower bounds. The first one is an extension of the improved energetic reasoning to the unrelated parallel machine problem. The second one is based on a preemptive relaxation that includes valid inequalities. We report the results of computational experiments that were carried out on both industrial and generated instances and that provide evidence of the efficacy of the proposed lower bounds.

DOI 10.1504/EJIE.2013.057383

Cilt 7