Hybrid flow-shop with adjustment
Kybernetika (2011)
- Volume: 47, Issue: 1, page 50-59
- ISSN: 0023-5954
Access Full Article
top
Abstract
topHow to cite
topPelikán, Jan. "Hybrid flow-shop with adjustment." Kybernetika 47.1 (2011): 50-59. <http://eudml.org/doc/196675>.
@article{Pelikán2011,
abstract = {The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering production jobs in mechanical engineering, in order to minimize the overall processing time, the makespan. The production jobs are processed by machines, and each job is assigned to a certain machine for technological reasons. Before processing a job, the machine has to be adjusted; there is only one adjuster who adjusts all of the machines. This problem is treated as a hybrid two-stage flow-shop: the first stage of the job processing is represented by the machine adjustment for the respective job, and the second stage by the processing of the job itself on the adjusted machine. In other words, the job-processing consists of two tasks, where the first task is the machine adjustment for the job, and the second task is the job processing itself. A mathematical model is proposed, a heuristic method is formulated, and the NP hardness of the problem, called a “hybrid flow-shop with adjustment”, is proved.},
author = {Pelikán, Jan},
journal = {Kybernetika},
keywords = {flow-shop; case study; integer programming; heuristics; heuristics; flow-shop; case study; integer programming},
language = {eng},
number = {1},
pages = {50-59},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Hybrid flow-shop with adjustment},
url = {http://eudml.org/doc/196675},
volume = {47},
year = {2011},
}
TY - JOUR
AU - Pelikán, Jan
TI - Hybrid flow-shop with adjustment
JO - Kybernetika
PY - 2011
PB - Institute of Information Theory and Automation AS CR
VL - 47
IS - 1
SP - 50
EP - 59
AB - The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering production jobs in mechanical engineering, in order to minimize the overall processing time, the makespan. The production jobs are processed by machines, and each job is assigned to a certain machine for technological reasons. Before processing a job, the machine has to be adjusted; there is only one adjuster who adjusts all of the machines. This problem is treated as a hybrid two-stage flow-shop: the first stage of the job processing is represented by the machine adjustment for the respective job, and the second stage by the processing of the job itself on the adjusted machine. In other words, the job-processing consists of two tasks, where the first task is the machine adjustment for the job, and the second task is the job processing itself. A mathematical model is proposed, a heuristic method is formulated, and the NP hardness of the problem, called a “hybrid flow-shop with adjustment”, is proved.
LA - eng
KW - flow-shop; case study; integer programming; heuristics; heuristics; flow-shop; case study; integer programming
UR - http://eudml.org/doc/196675
ER -
References
top- Blazewicz, J., Ecker, K. H., Pesch, E., Schmidt, G., Weglarz, J., Scheduling Computer and Manufacturing Processes, Springer–Verlag, Berlin 1996. (1996) Zbl0911.90201
- Cho, Y., Sahni, S., 10.1287/opre.29.3.511, Oper. Res. 29 (1981), 3, 511–522. (1981) Zbl0455.90043MR0629191DOI10.1287/opre.29.3.511
- Kubzin, M., Strusevich, A., 10.1287/opre.1060.0301, Oper. Res. 54, 4, 2006, 789–800. (2006) Zbl1167.90669DOI10.1287/opre.1060.0301
- Lenstra, J. K., Rinnooy Kan, A. H. G., 10.1287/opre.26.1.22, Oper. Res. 26 (1978), 1, 22–35. (1978) Zbl0371.90060MR0462553DOI10.1287/opre.26.1.22
NotesEmbed ?
topYou 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.