Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Andres Felipe Bernate Lara"'
Publikováno v:
MIM 2016
MIM 2016, Jun 2016, Troyes, France
MIM 2016, Jun 2016, Troyes, France
This study examines large sample size of instances and tries to extract useful knowledge about the domain of parallel machine scheduling problem (PMSP) and solution space explored. The aim of this study is to provide statistical interpretations and c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e9c6982cdfb5471277231693a5f5a40
https://hal-utt.archives-ouvertes.fr/hal-02611088
https://hal-utt.archives-ouvertes.fr/hal-02611088
Publikováno v:
14th Symposium on Information Control Problems in Manufacturing INCOM
14th Symposium on Information Control Problems in Manufacturing INCOM, May 2012, Bucharest, Romania
14th Symposium on Information Control Problems in Manufacturing INCOM, May 2012, Bucharest, Romania
This article deals with the parallel machines scheduling problem to minimize the total tardiness, when jobs have different release dates. Preemption and splitting are not allowed. Since machines are considered identical, assigning a job to any of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::abf13f40ad802c31d936b8247bfa0d9c
https://doi.org/10.3182/20120523-3-ro-2023.00198
https://doi.org/10.3182/20120523-3-ro-2023.00198
Publikováno v:
Metaheuristics for Production Systems
Metaheuristics for Production Systems, 60, pp.241-262, 2016, Operations Research/Computer Science Interfaces Series, 978-3-319-23350-5. ⟨10.1007/978-3-319-23350-5_11⟩
Operations Research/Computer Science Interfaces Series ISBN: 9783319233499
Metaheuristics for Production Systems, 60, pp.241-262, 2016, Operations Research/Computer Science Interfaces Series, 978-3-319-23350-5. ⟨10.1007/978-3-319-23350-5_11⟩
Operations Research/Computer Science Interfaces Series ISBN: 9783319233499
International audience; This chapter deals with the parallel machines scheduling problem to minimize the total tardiness , when jobs have different release dates . Preemption and splitting are not allowed and machines are considered identical. Since
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::60a66657910d8f4682c89c695f9dc293
https://hal-utt.archives-ouvertes.fr/hal-02490453
https://hal-utt.archives-ouvertes.fr/hal-02490453
Publikováno v:
2013 International Conference on Control, Decision and Information Technologies (CoDIT)
2013 International Conference on Control, Decision and Information Technologies (CoDIT), May 2013, Hammamet, Tunisia. pp.149-153, ⟨10.1109/CoDIT.2013.6689535⟩
2013 International Conference on Control, Decision and Information Technologies (CoDIT), May 2013, Hammamet, Tunisia. pp.149-153, ⟨10.1109/CoDIT.2013.6689535⟩
This paper deals with a hybrid flow shop scheduling problem where the objective is to minimize total tardiness. Since the described shop is hybrid, each stage could be composed of one or many identical machines. Preemption and splitting are not allow
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5367840d1320c03ea407df7150a77208
https://hal-utt.archives-ouvertes.fr/hal-02493946
https://hal-utt.archives-ouvertes.fr/hal-02493946