//--> //--> //-->
Toggle navigation
Logout
Change account settings
EN
DE
ES
FR
A-Z
Beta
About EconBiz
News
Thesaurus (STW)
Research Skills
Help
EN
DE
ES
FR
My account
Logout
Change account settings
Login
Publications
Events
Your search terms
Search
Retain my current filters
~subject:"NP-hard"
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
NP-hard
Scheduling problem
50
Scheduling-Verfahren
50
Theorie
42
Theory
42
Durchlaufzeit
32
Lead time
32
Scheduling
20
Production control
13
Produktionssteuerung
13
Algorithm
11
Algorithmus
11
Heuristics
11
Heuristik
11
USA
9
United States
9
Mathematical programming
6
Mathematische Optimierung
6
Operations Research
6
Operations research
6
Terminplanung
6
Time scheduling
6
Makespan
4
Online algorithms
4
Total weighted completion time
4
Maximum cost
3
Maximum lateness
3
Total completion time
3
batching machine
3
maximum cost
3
Air pollution
2
Batch processing
2
China
2
Climate change
2
Computational complexity
2
Deadlines
2
Electric vehicle
2
Elektrofahrzeug
2
Greenhouse gas emissions
2
Hierarchical optimization
2
more ...
less ...
Online availability
All
Undetermined
5
Type of publication
All
Article
6
Type of publication (narrower categories)
All
Article in journal
6
Aufsatz in Zeitschrift
6
Language
All
English
6
Author
All
Yuan, Jinjiang
6
Chen, Rubing
2
Geng, Zhichao
2
Gao, Yuan
1
Lu, Lingfa
1
Wan, Long
1
Wei, Hongjun
1
Zhang, Liqi
1
more ...
less ...
Published in...
All
Journal of scheduling
2
4OR : quarterly journal of the Belgian, French and Italian Operations Research Societies
1
International journal of production research
1
OR spectrum : quantitative approaches in management
1
Operations research letters
1
Source
All
ECONIS (ZBW)
6
Showing
1
-
6
of
6
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
Unary NP-hardness of minimizing the number of tardy jobs with deadlines
Yuan, Jinjiang
- In:
Journal of scheduling
20
(
2017
)
2
,
pp. 211-218
Persistent link: https://www.econbiz.de/10011691589
Saved in:
2
A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
Wan, Long
;
Yuan, Jinjiang
;
Geng, Zhichao
- In:
Journal of scheduling
18
(
2015
)
3
,
pp. 315-323
Persistent link: https://www.econbiz.de/10011290705
Saved in:
3
Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
Chen, Rubing
;
Yuan, Jinjiang
- In:
4OR : quarterly journal of the Belgian, French and …
18
(
2020
)
2
,
pp. 177-196
Persistent link: https://www.econbiz.de/10012222324
Saved in:
4
Two-machine open-shop scheduling with rejection to minimize the makespan
Zhang, Liqi
;
Lu, Lingfa
;
Yuan, Jinjiang
- In:
OR spectrum : quantitative approaches in management
38
(
2016
)
2
,
pp. 519-529
Persistent link: https://www.econbiz.de/10011702079
Saved in:
5
Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time
Wei, Hongjun
;
Yuan, Jinjiang
- In:
Operations research letters
47
(
2019
)
1
,
pp. 41-46
Persistent link: https://www.econbiz.de/10011991332
Saved in:
6
Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work
Chen, Rubing
;
Gao, Yuan
;
Geng, Zhichao
;
Yuan, Jinjiang
- In:
International journal of production research
61
(
2023
)
22
,
pp. 7630-7648
Persistent link: https://www.econbiz.de/10014383411
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
//-->