A sequencing problem for optimal job processing by the turning-lathe.

A. Adrabiński; J. Grabowski; M. Wodecki

Mathematica Applicanda (1994)

  • Volume: 23, Issue: 37
  • ISSN: 1730-2668

Abstract

top
The paper is dealing with a computer-aided system for a turning-lathe machine. It. is divided into two parts. The first one considers the sequencing problem for a job processing by the machine. It describes the problem and then presents a mathematical model and an algorithm for the minimalization of a processing time. We also prove that the pro-blem is NP-hard. The second part, on the other side, considers the problem of the tool replacement by the tnrning-lathe. An algorithm for finding an optimal sequence of tool re-placement intervals in the tool-store of the machine is presented. Extensive computational experiments for problems with up to 60 jobs show a high efficiency of the system.

How to cite

top

A. Adrabiński, J. Grabowski, and M. Wodecki. "A sequencing problem for optimal job processing by the turning-lathe.." Mathematica Applicanda 23.37 (1994): null. <http://eudml.org/doc/293287>.

@article{A1994,
abstract = {The paper is dealing with a computer-aided system for a turning-lathe machine. It. is divided into two parts. The first one considers the sequencing problem for a job processing by the machine. It describes the problem and then presents a mathematical model and an algorithm for the minimalization of a processing time. We also prove that the pro-blem is NP-hard. The second part, on the other side, considers the problem of the tool replacement by the tnrning-lathe. An algorithm for finding an optimal sequence of tool re-placement intervals in the tool-store of the machine is presented. Extensive computational experiments for problems with up to 60 jobs show a high efficiency of the system.},
author = {A. Adrabiński, J. Grabowski, M. Wodecki},
journal = {Mathematica Applicanda},
keywords = {.},
language = {eng},
number = {37},
pages = {null},
title = {A sequencing problem for optimal job processing by the turning-lathe.},
url = {http://eudml.org/doc/293287},
volume = {23},
year = {1994},
}

TY - JOUR
AU - A. Adrabiński
AU - J. Grabowski
AU - M. Wodecki
TI - A sequencing problem for optimal job processing by the turning-lathe.
JO - Mathematica Applicanda
PY - 1994
VL - 23
IS - 37
SP - null
AB - The paper is dealing with a computer-aided system for a turning-lathe machine. It. is divided into two parts. The first one considers the sequencing problem for a job processing by the machine. It describes the problem and then presents a mathematical model and an algorithm for the minimalization of a processing time. We also prove that the pro-blem is NP-hard. The second part, on the other side, considers the problem of the tool replacement by the tnrning-lathe. An algorithm for finding an optimal sequence of tool re-placement intervals in the tool-store of the machine is presented. Extensive computational experiments for problems with up to 60 jobs show a high efficiency of the system.
LA - eng
KW - .
UR - http://eudml.org/doc/293287
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.