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
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
Search: subject:"Pseudo polynomial time algorithm"
Narrow search
Narrow search
Year of publication
From:
To:
Subject
All
Algorithm
5
Algorithmus
5
Pseudo-polynomial time algorithm
5
Scheduling problem
5
Scheduling-Verfahren
5
Theorie
5
Theory
5
FPTAS
4
Just-in-time scheduling
3
Production control
3
Produktionssteuerung
3
Resource allocation
3
Controllable processing times
2
Durchlaufzeit
2
Flow shop
2
Lead time
2
pseudo-polynomial time algorithm
2
Approximation algorithms
1
Balanced connected partition
1
Complexity
1
Controllable processing time
1
Dynamic programming
1
Dynamische Optimierung
1
Flow-shop
1
Generalized due-dates
1
Just in Time
1
Just in time
1
Lieferkette
1
Machine unavailability period
1
N P-hard
1
No-wait restriction
1
Parameterized complexity.
1
Production planning
1
Produktionsplanung
1
Pseudo polynomial time algorithm
1
Scheduling
1
Single machine
1
Single-machine scheduling
1
Supply chain
1
capacitated facilities
1
more ...
less ...
Online availability
All
Undetermined
5
Free
1
Type of publication
All
Article
8
Type of publication (narrower categories)
All
Article in journal
5
Aufsatz in Zeitschrift
5
Language
All
English
5
Undetermined
3
Author
All
Shabtay, Dvir
6
Bensoussan, Yaron
2
Kaspi, Moshe
2
Oron, Daniel
2
Fan, Lidan
1
Lee, Kangbok
1
Lei, Lei
1
Mosheiov, Gur
1
Wang, Gang
1
Wang, Lele
1
Wu, Di
1
Wu, Weili
1
Zhang, Zhao
1
more ...
less ...
Published in...
All
Journal of the Operational Research Society : OR
2
European Journal of Operational Research
1
European journal of operational research : EJOR
1
International Journal of Production Economics
1
International journal of production economics
1
Journal of Global Optimization
1
Journal of scheduling : JOS
1
more ...
less ...
Source
All
ECONIS (ZBW)
5
RePEc
3
Showing
1
-
8
of
8
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
Mosheiov, Gur
;
Oron, Daniel
;
Shabtay, Dvir
- In:
Journal of scheduling : JOS
25
(
2022
)
5
,
pp. 577-587
Persistent link: https://www.econbiz.de/10013453936
Saved in:
2
Single-machine scheduling with machine unavailability periods and resource dependent processing times
Shabtay, Dvir
- In:
European journal of operational research : EJOR
296
(
2022
)
2
,
pp. 423-439
Persistent link: https://www.econbiz.de/10012663343
Saved in:
3
Proportionate flow-shop scheduling with rejection
Shabtay, Dvir
;
Oron, Daniel
- In:
Journal of the Operational Research Society : OR
67
(
2016
)
5
,
pp. 752-769
Persistent link: https://www.econbiz.de/10011517443
Saved in:
4
Supply chain scheduling with receiving deadlines and non-linear penalty
Wang, Gang
;
Lei, Lei
;
Lee, Kangbok
- In:
Journal of the Operational Research Society : OR
66
(
2015
)
3
,
pp. 380-391
Persistent link: https://www.econbiz.de/10010487479
Saved in:
5
Max-min weight balanced connected partition
Wang, Lele
;
Zhang, Zhao
;
Wu, Di
;
Wu, Weili
;
Fan, Lidan
- In:
Journal of Global Optimization
57
(
2013
)
4
,
pp. 1263-1275
degree is bounded by a constant. A
pseudo-polynomial
time
algorithm
is given, based on which an FPTAS is obtained for …
Persistent link: https://www.econbiz.de/10010994149
Saved in:
6
The just-in-time scheduling problem in a flow-shop scheduling system
Shabtay, Dvir
- In:
European Journal of Operational Research
216
(
2012
)
3
,
pp. 521-532
We study the problem of maximizing the weighted number of just-in-time (JIT) jobs in a flow-shop scheduling system under four different scenarios. The first scenario is where the flow-shop includes only two machines and all the jobs have the same gain for being completed JIT. For this scenario,...
Persistent link: https://www.econbiz.de/10010871244
Saved in:
7
A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system
Shabtay, Dvir
;
Bensoussan, Yaron
;
Kaspi, Moshe
- In:
International Journal of Production Economics
136
(
2012
)
1
,
pp. 67-74
constant processing times, a
pseudo-polynomial
time
algorithm
for its solution exists. In addition, we show how the
pseudo-polynomial
…
time
algorithm
can be converted into a two-dimensional fully polynomial approximation scheme for finding an approximate …
Persistent link: https://www.econbiz.de/10010572555
Saved in:
8
A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system
Shabtay, Dvir
;
Bensoussan, Yaron
;
Kaspi, Moshe
- In:
International journal of production economics
136
(
2012
)
1
,
pp. 67-74
Persistent link: https://www.econbiz.de/10009503679
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
