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 New Nested Partition Algorithm for Parallel Machine Sched..:
, In:
2022 IEEE 18th International Conference on Automation Science and Engineering (CASE)
,
Wang, Chaoran
;
Shi, Leyuan
- p. 2087-2092 , 2022
Link:
https://doi.org/10.1109/CASE49997.2022.9926533
RT T1
2022 IEEE 18th International Conference on Automation Science and Engineering (CASE)
: T1
A New Nested Partition Algorithm for Parallel Machine Scheduling Problem with hard Q-Times and Setup Times
UL https://suche.suub.uni-bremen.de/peid=ieee-9926533&Exemplar=1&LAN=DE A1 Wang, Chaoran A1 Shi, Leyuan YR 2022 SN 2161-8089 K1 Job shop scheduling K1 Processor scheduling K1 Heuristic algorithms K1 Parallel machines K1 Sampling methods K1 Robustness K1 Partitioning algorithms SP 2087 OP 2092 LK http://dx.doi.org/https://doi.org/10.1109/CASE49997.2022.9926533 DO https://doi.org/10.1109/CASE49997.2022.9926533 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)