//--> //--> //-->
Toggle navigation
Logout
Change account settings
EN
DE
ES
FR
A-Z
Beta
About EconBiz
News
Thesaurus (STW)
Academic Skills
Help
EN
DE
ES
FR
My account
Logout
Change account settings
Login
Publications
Events
Your search terms
Search
Retain my current filters
~subject:"Branch and Bound"
Search options
All Fields
Title
Exact title
Subject
Author
Institution
ISBN/ISSN
Published in...
Publisher
Open Access only
Advanced
Search history
My EconBiz
Favorites
Loans
Reservations
Fines
You are here:
Home
SOME IMPROVED ALGORITHMS ON TH...
Similar by person
Narrow search
Delete all filters
| 1 applied filter
Year of publication
From:
To:
Subject
All
Branch and Bound
Scheduling problem
51
Scheduling-Verfahren
51
Theorie
47
Theory
47
Durchlaufzeit
33
Lead time
33
Scheduling
22
Algorithm
20
Algorithmus
20
Production control
16
Produktionssteuerung
16
Heuristics
7
Heuristik
7
Mathematical programming
6
Mathematische Optimierung
6
NP-hard
6
Operations Research
6
Operations research
6
Consumer behaviour
5
Konsumentenverhalten
5
Terminplanung
5
Time scheduling
5
Artificial intelligence
4
Künstliche Intelligenz
4
Makespan
4
Online algorithms
4
Total weighted completion time
4
Branch-and-Bound
3
China
3
Einkaufszentrum
3
Impact assessment
3
Maximum cost
3
Maximum lateness
3
Rescheduling
3
Shopping center
3
Total completion time
3
Wirkungsanalyse
3
batching machine
3
maximum cost
3
more ...
less ...
Online availability
All
Undetermined
2
Type of publication
All
Article
3
Type of publication (narrower categories)
All
Article in journal
3
Aufsatz in Zeitschrift
3
Language
All
English
3
Author
All
Yuan, Jinjiang
3
Chen, Rubing
2
Cheng, T. C. E.
1
Ng, C. T.
1
Wan, Long
1
Published in...
All
European journal of operational research : EJOR
1
Journal of scheduling
1
Operations research letters
1
Source
All
ECONIS (ZBW)
3
Showing
1
-
3
of
3
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
Wan, Long
;
Yuan, Jinjiang
- In:
Operations research letters
41
(
2013
)
4
,
pp. 363-365
Persistent link: https://www.econbiz.de/10009772782
Saved in:
2
Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
Chen, Rubing
;
Yuan, Jinjiang
- In:
Journal of scheduling
22
(
2019
)
5
,
pp. 595-601
Persistent link: https://www.econbiz.de/10012117029
Saved in:
3
Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
Chen, Rubing
;
Yuan, Jinjiang
;
Ng, C. T.
;
Cheng, T. C. E.
- In:
European journal of operational research : EJOR
293
(
2021
)
1
,
pp. 79-92
Persistent link: https://www.econbiz.de/10012502451
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
//-->