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
The Optimality Region for a Single-Machine Scheduling Probl..:
Yuri N. Sotskov
;
Natalja G. Egorova
https://www.mdpi.com/2227-7390/7/5/382. , 2019
Link:
https://doi.org/10.3390/math7050382
RT Journal T1
The Optimality Region for a Single-Machine Scheduling Problem with Bounded Durations of the Jobs and the Total Completion Time Objective
UL https://suche.suub.uni-bremen.de/peid=base-ftdoajarticles:oai:doaj.org_article:5e9a409907b44329a69e6c4055a1b1ea&Exemplar=1&LAN=DE A1 Yuri N. Sotskov A1 Natalja G. Egorova PB MDPI AG YR 2019 K1 single-machine scheduling K1 uncertain job durations K1 total completion time objective K1 optimality region K1 Mathematics K1 QA1-939 JF https://www.mdpi.com/2227-7390/7/5/382 LK http://dx.doi.org/https://doi.org/10.3390/math7050382 DO https://doi.org/10.3390/math7050382 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)