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

Title Development of lower bounds for the scheduling of setup tasks in serial production lines
Author Pessan, C., Neron, E., Haouari, Mohamed
Publication Date: 2013
Publication Place - Inderscience Publishers
Subject 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
Type Periodical
Language English
Digital Yes
Manuscript No
Library: Özyeğin University
Library Asset ID 1751-5262
Record ID 78cb4737-4b8b-499d-aa55-b8b9bb931bad
Library Location Industrial Engineering
Date 2013
Notes Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Sample Text 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
View in source Özyeğin University Özyeğin University - Historical works, archives, and periodicals search engine
Özyeğin University - Historical works, archives, and periodicals search engine Özyeğin University

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

Author Pessan, C., Neron, E., Haouari, Mohamed
Publication Date 2013
Publication Place - Inderscience Publishers
Subject 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
Type Periodical
Language English
Digital Yes
Manuscript No
Library Özyeğin University
Library Asset ID 1751-5262
Record ID 78cb4737-4b8b-499d-aa55-b8b9bb931bad
Library Location Industrial Engineering
Date 2013
Notes Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Sample Text 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
Özyeğin University - Historical works, archives, and periodicals search engine
Özyeğin University You are being redirected...

Please wait