EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"polynomial algorithms"
Narrow search

Narrow search

Year of publication
Subject
All
Algorithm 6 Algorithmus 6 Scheduling problem 5 Scheduling-Verfahren 5 Theorie 5 Theory 5 Polynomial algorithms 4 Intersection graphs 2 Makespan 2 Mathematical programming 2 Mathematische Optimierung 2 Multiprocessor task scheduling 2 Project management 2 Project scheduling 2 Projektmanagement 2 polynomial algorithms 2 strongly polynomial algorithms 2 Allocation 1 Allokation 1 Cooperative game 1 Durchlaufzeit 1 Fruit 1 Game theory 1 Heuristics 1 Heuristik 1 Home-away patterns 1 Integrated scheduling 1 Lead time 1 Lieferkette 1 Lower bounds 1 Multi-league sports scheduling 1 NP-complete problems 1 NP-hardness 1 Netzplantechnik 1 Obst 1 One-machine scheduling 1 Order assignment 1 PERT network 1 Production control 1 Produktionssteuerung 1
more ... less ...
Online availability
All
Undetermined 8 Free 1
Type of publication
All
Article 10 Book / Working Paper 1
Type of publication (narrower categories)
All
Article in journal 6 Aufsatz in Zeitschrift 6
Language
All
English 7 Undetermined 4
Author
All
Gentili, Monica 2 Paolo Dell’Olmo 2 Agnetis, A. 1 Arkhipov, Dmitry 1 Battaïa, Olga 1 Beliën, Jeroen 1 Castro, Javier 1 Davari, Morteza 1 Goossens, Dries 1 Granot, D. 1 Granot, F. 1 Gómez, Daniel 1 Hermelin, Danny 1 Lambers, Roel 1 Lazarev, Alexander 1 Lucertini, M. 1 Molter, Hendrik 1 Nicolo, F. 1 Ramalhinho-Lourenço, Helena 1 Shabtay, Dvir 1 Spieksma, Frits C. R. 1 Tejada, Juan 1 Végh, László A. 1 Wang, Gang 1 Zhu, W. R. 1
more ... less ...
Institution
All
Department of Economics and Business, Universitat Pompeu Fabra 1
Published in...
All
Central European journal of operations research : CEJOR ; official journal of the Austrian, Croatian, Czech, Hungarian, Slovakian and Slovenian OR Societies 1 Computational Statistics 1 Economics Working Papers / Department of Economics and Business, Universitat Pompeu Fabra 1 European journal of operational research : EJOR 1 INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences 1 International Journal of Game Theory 1 Management Science 1 Mathematical Methods of Operations Research 1 Mathematics of operations research 1 Omega : the international journal of management science 1 Operations research letters 1
more ... less ...
Source
All
ECONIS (ZBW) 6 RePEc 5
Showing 1 - 10 of 11
Cover Image
Order assignment and two-stage integrated scheduling in fruit and vegetable supply chains
Wang, Gang - In: Omega : the international journal of management science 124 (2024), pp. 1-12
Persistent link: https://www.econbiz.de/10014533517
Saved in:
Cover Image
Minimizing the weighted number of tardy jobs via (max,+)-convolutions
Hermelin, Danny; Molter, Hendrik; Shabtay, Dvir - In: INFORMS journal on computing : JOC ; charting new … 36 (2024) 3, pp. 836-848
Persistent link: https://www.econbiz.de/10014634767
Saved in:
Cover Image
The multi-league sports scheduling problem, or how to schedule thousands of matches
Davari, Morteza; Goossens, Dries; Beliën, Jeroen; … - In: Operations research letters 48 (2020) 2, pp. 180-187
Persistent link: https://www.econbiz.de/10012254038
Saved in:
Cover Image
An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem
Arkhipov, Dmitry; Battaïa, Olga; Lazarev, Alexander - In: European journal of operational research : EJOR 275 (2019) 1, pp. 35-44
Persistent link: https://www.econbiz.de/10011993208
Saved in:
Cover Image
A strongly polynomial algorithm for generalized flow maximization
Végh, László A. - In: Mathematics of operations research 42 (2017) 1, pp. 179-211
Persistent link: https://www.econbiz.de/10011654623
Saved in:
Cover Image
Allocating slacks in stochastic PERT network
Castro, Javier; Gómez, Daniel; Tejada, Juan - In: Central European journal of operations research : CEJOR … 22 (2014) 1, pp. 37-52
Persistent link: https://www.econbiz.de/10010231696
Saved in:
Cover Image
A polynomial algorithm for special case of the one-machine scheduling problem with time-lags
Ramalhinho-Lourenço, Helena - Department of Economics and Business, Universitat … - 1998
The standard one-machine scheduling problem consists in scheduling a set of jobs in one machine which can handle only one job at a time, minimizing the maximum lateness. Each job is available for processing at its release date, requires a known processing time and after finishing the processing,...
Persistent link: https://www.econbiz.de/10005707986
Saved in:
Cover Image
Graph models for scheduling systems with machine saturation property
Paolo Dell’Olmo; Gentili, Monica - In: Mathematical Methods of Operations Research 63 (2006) 2, pp. 329-340
Let <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$T \, =\, \{T_1, T_2, \ldots, T_n\}$$</EquationSource> </InlineEquation> be a set of n independent tasks and <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$\mathcal{P}=\{P_1, P_2,\ldots, P_m\}$$</EquationSource> </InlineEquation> a set of m processors. During each time instant, each processor can be used by a single task at most. A schedule is for each task an allocation of one or more time...</equationsource></inlineequation></equationsource></inlineequation>
Persistent link: https://www.econbiz.de/10010999898
Saved in:
Cover Image
Graph models for scheduling systems with machine saturation property
Paolo Dell’Olmo; Gentili, Monica - In: Computational Statistics 63 (2006) 2, pp. 329-340
Let $$T \, =\, \{T_1, T_2, \ldots, T_n\}$$ be a set of n independent tasks and $$\mathcal{P}=\{P_1, P_2,\ldots, P_m\}$$ a set of m processors. During each time instant, each processor can be used by a single task at most. A schedule is for each task an allocation of one or more time intervals to...
Persistent link: https://www.econbiz.de/10010759486
Saved in:
Cover Image
Characterization sets for the nucleolus
Granot, D.; Granot, F.; Zhu, W. R. - In: International Journal of Game Theory 27 (1998) 3, pp. 359-374
We introduce the concept of a characterization set for the nucleolus of a cooperative game and develop sufficient conditions for a collection of coalitions to form a characterization set thereof. Further, we formalize Kopelowitz's method for computing the nucleolus through the notion of a...
Persistent link: https://www.econbiz.de/10005155711
Saved in:
  • 1
  • 2
  • Next
  • Last
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...