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
Solving two-machine flow shop scheduling problem with total..:
, In:
2023 IEEE 23rd International Symposium on Computational Intelligence and Informatics (CINTI)
,
Bozejko, Wojciech
;
Klempous, Ryszard
;
Uchronski, Mariusz
. - p. 000037-000040 , 2023
Link:
https://doi.org/10.1109/CINTI59972.2023.10382117
RT T1 <cTitle>2023 IEEE 23rd International Symposium on Computational Intelligence and Informatics (CINTI)</cTitle>: T1 <Title>Solving two-machine flow shop scheduling problem with total weighted number of on-time tasks maximization criterion on D-Wave quantum computer</Title> UL https://suche.suub.uni-bremen.de/peid=ieee-10382117&Exemplar=1&LAN=DE A1 Bozejko, Wojciech A1 Klempous, Ryszard A1 Uchronski, Mariusz A1 Wodecki, Mieczyslaw YR 2023 SN 2471-9269 K1 Upper bound K1 Job shop scheduling K1 Processor scheduling K1 NP-hard problem K1 Computational modeling K1 Quantum annealing K1 Probabilistic logic K1 quantum annealing K1 exact algorithm K1 scheduling SP 000037 OP 000040 LK http://dx.doi.org/https://doi.org/10.1109/CINTI59972.2023.10382117 DO https://doi.org/10.1109/CINTI59972.2023.10382117 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
