I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
A two-stage invasive weed optimization algorithm for distri..:
, In:
2017 Chinese Automation Congress (CAC)
,
Sang, Hong-yan
;
Pan, Quan-ke
;
Duan, Pei-yong
.. - p. 7051-7056 , 2017
Link:
https://doi.org/10.1109/CAC.2017.8244049
RT T1
2017 Chinese Automation Congress (CAC)
: T1
A two-stage invasive weed optimization algorithm for distributed assembly permutation flowshop problem
UL https://suche.suub.uni-bremen.de/peid=ieee-8244049&Exemplar=1&LAN=DE A1 Sang, Hong-yan A1 Pan, Quan-ke A1 Duan, Pei-yong A1 Li, Jun-qing A1 Duan, Peng YR 2017 K1 Handheld computers K1 Assembly systems K1 Optimization K1 Sociology K1 Statistics K1 Floors K1 Economic indicators K1 assembly system K1 meta-heuristics K1 invasive weed optimization SP 7051 OP 7056 LK http://dx.doi.org/https://doi.org/10.1109/CAC.2017.8244049 DO https://doi.org/10.1109/CAC.2017.8244049 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)