Matches in SemOpenAlex for { <https://semopenalex.org/work/W2570746651> ?p ?o ?g. }
Showing items 1 to 55 of
55
with 100 items per page.
- W2570746651 abstract "The paper deals with human-computer interaction in which the cooperation leads to solve a difficult issue of discrete optimization. Considered jobs scheduling problem in a robotic cell consisting of two machines and a robotic operator. Only one of two machines can work at a time and there are setup times between successive operations on a machine. The goal is to determine a schedule — permutation of jobs — and an assignment of jobs to machines, which minimize the minimal cycle time. We show that although there is exponential number of assignments of jobs to machines, it is possible to determine optimal assignment in the polynomial time. Next, we propose higher level metaheuristics — tabu search and evolutionary algorithm." @default.
- W2570746651 created "2017-01-13" @default.
- W2570746651 creator A5013367027 @default.
- W2570746651 creator A5028459441 @default.
- W2570746651 creator A5032702795 @default.
- W2570746651 creator A5058017032 @default.
- W2570746651 creator A5063124631 @default.
- W2570746651 date "2016-10-01" @default.
- W2570746651 modified "2023-10-01" @default.
- W2570746651 title "Cyclic scheduling of a robotic cell" @default.
- W2570746651 cites W1033407579 @default.
- W2570746651 cites W1971415293 @default.
- W2570746651 cites W1973500892 @default.
- W2570746651 cites W2023770634 @default.
- W2570746651 cites W2293987903 @default.
- W2570746651 doi "https://doi.org/10.1109/coginfocom.2016.7804579" @default.
- W2570746651 hasPublicationYear "2016" @default.
- W2570746651 type Work @default.
- W2570746651 sameAs 2570746651 @default.
- W2570746651 citedByCount "6" @default.
- W2570746651 countsByYear W25707466512018 @default.
- W2570746651 countsByYear W25707466512019 @default.
- W2570746651 countsByYear W25707466512020 @default.
- W2570746651 countsByYear W25707466512022 @default.
- W2570746651 crossrefType "proceedings-article" @default.
- W2570746651 hasAuthorship W2570746651A5013367027 @default.
- W2570746651 hasAuthorship W2570746651A5028459441 @default.
- W2570746651 hasAuthorship W2570746651A5032702795 @default.
- W2570746651 hasAuthorship W2570746651A5058017032 @default.
- W2570746651 hasAuthorship W2570746651A5063124631 @default.
- W2570746651 hasConcept C126255220 @default.
- W2570746651 hasConcept C206729178 @default.
- W2570746651 hasConcept C33923547 @default.
- W2570746651 hasConcept C41008148 @default.
- W2570746651 hasConceptScore W2570746651C126255220 @default.
- W2570746651 hasConceptScore W2570746651C206729178 @default.
- W2570746651 hasConceptScore W2570746651C33923547 @default.
- W2570746651 hasConceptScore W2570746651C41008148 @default.
- W2570746651 hasLocation W25707466511 @default.
- W2570746651 hasOpenAccess W2570746651 @default.
- W2570746651 hasPrimaryLocation W25707466511 @default.
- W2570746651 hasRelatedWork W1507894569 @default.
- W2570746651 hasRelatedWork W1882733036 @default.
- W2570746651 hasRelatedWork W2125095596 @default.
- W2570746651 hasRelatedWork W2160425906 @default.
- W2570746651 hasRelatedWork W2282814746 @default.
- W2570746651 hasRelatedWork W2401335561 @default.
- W2570746651 hasRelatedWork W2546696010 @default.
- W2570746651 hasRelatedWork W2942712689 @default.
- W2570746651 hasRelatedWork W2997221951 @default.
- W2570746651 hasRelatedWork W3174582865 @default.
- W2570746651 isParatext "false" @default.
- W2570746651 isRetracted "false" @default.
- W2570746651 magId "2570746651" @default.
- W2570746651 workType "article" @default.