Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Fulvio Antonio Cappadonna"'
Publikováno v:
International Journal of Industrial Engineering Computations, Vol 8, Iss 4, Pp 427-440 (2017)
This paper deals with Flow-shop Sequence-Dependent Group Scheduling and worker assignment problem. Flow-shop allows the process of a set of families of products applying the group technology concept to reduce setup costs, lead times, and work-in-proc
Externí odkaz:
https://doaj.org/article/dfe5683e048b4ef0a069c9b595b11931
Publikováno v:
Algorithms, Vol 7, Iss 3, Pp 376-396 (2014)
Production processes in Cellular Manufacturing Systems (CMS) often involve groups of parts sharing the same technological requirements in terms of tooling and setup. The issue of scheduling such parts through a flow-shop production layout is known as
Externí odkaz:
https://doaj.org/article/757d0e62c9794f1b925b5d9867693d3b
Publikováno v:
Computers & Industrial Engineering. 91:290-301
We study a parallel-machine tool-change scheduling problem.We develop a mixed-integer linear programming model.We develop a hybrid genetic algorithm.We compare the proposed metaheuristic with other methods.A statistical analysis emphasizes the effect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5db50f21143ebbf1c021e4d13a1b5841
https://doi.org/10.1016/j.cie.2015.11.015
https://doi.org/10.1016/j.cie.2015.11.015
Publikováno v:
Journal of Intelligent Manufacturing. 28:1269-1283
In this paper, the flow-shop sequence-dependent group scheduling (FSDGS) problem is addressed with reference to the makespan minimization objective. In order to effectively cope with the issue at hand, a hybrid metaheuristic procedure integrating fea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8f76eb29c1be703323bfcdd4b6376889
https://doi.org/10.1007/s10845-015-1049-1
https://doi.org/10.1007/s10845-015-1049-1
Publikováno v:
The International Journal of Advanced Manufacturing Technology. 75:833-847
The hybrid flow shop with parallel batching (HFSPB) is a kind of flow shop production system wherein some stages may be populated by parallel processors that simultaneously process groups of jobs. This paper addresses the makespan minimization proble
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::69c83134e6491bf1837d170d97f854f3
https://doi.org/10.1007/s00170-014-6195-7
https://doi.org/10.1007/s00170-014-6195-7
Publikováno v:
Journal of Advanced Manufacturing Systems. 13:73-88
In this paper, the single machine total weighted completion time scheduling problem is studied. The jobs have nonzero release time and processing time increases during the production due to the effect of deterioration on the machine. An operator sets
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c8f84501e58417c82f88c60d4bc2b79
https://doi.org/10.1142/s021968671450005x
https://doi.org/10.1142/s021968671450005x
Publikováno v:
The International Journal of Advanced Manufacturing Technology. 69:2799-2817
In this paper, the unrelated parallel machine scheduling problem with sequence-dependent setup times and limited human resources is addressed with reference to the makespan minimisation objective. Workers needed for setup operations are supposed to b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1f1aa69c9cb4a4efeb9f004ec1d203b
https://doi.org/10.1007/s00170-013-5221-5
https://doi.org/10.1007/s00170-013-5221-5
Publikováno v:
International Journal of Industrial Engineering Computations, Vol 8, Iss 4, Pp 427-440 (2017)
This paper deals with Flow-shop Sequence-Dependent Group Scheduling and worker assignment problem. Flow-shop allows the process of a set of families of products applying the group technology concept to reduce setup costs, lead times, and work-in-proc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::019f3f917697bc55e3199badeaa89e87
http://hdl.handle.net/20.500.11769/30904
http://hdl.handle.net/20.500.11769/30904
This paper addresses the total tardiness minimization problem in a manufacturing environment made by m uniform parallel processors subjected to regular maintenance activities. According to the so-called flexible periodic maintenance strategy, the tim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::128162059499925b613a2e0b7ef0d7de
http://hdl.handle.net/20.500.11769/38001
http://hdl.handle.net/20.500.11769/38001
Publikováno v:
Advances in Operations Research, Vol 2015 (2015)
The present paper aims to address the flow-shop sequence-dependent group scheduling problem with learning effect (FSDGSLE). The objective function to be minimized is the total completion time, that is, the makespan. The workers are required to carry
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03e37897d250f498667c4a309ae35aa2
http://hdl.handle.net/20.500.11769/18296
http://hdl.handle.net/20.500.11769/18296