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:"bottleneck assignment"
Narrow search

Narrow search

Year of publication
Subject
All
Bottleneck 3 Engpass 3 Scheduling problem 2 Scheduling-Verfahren 2 Theorie 2 Theory 2 Algorithm 1 Algorithmus 1 Bi-criteria bottleneck assignment problem 1 Bottleneck assignment 1 Bottleneck assignment problem 1 Branch and Bound 1 Branch-and-Bound 1 Branch-and-bound algorithms 1 Combinatorial optimization 1 Durchlaufzeit 1 Evolutionary algorithm 1 Evolutionärer Algorithmus 1 Lead time 1 Lexicographic approach 1 Makespan 1 Mathematical programming 1 Mathematische Optimierung 1 Model uncertainty 1 Non-linear programming 1 Operations Research 1 Operations research 1 Pareto efficiency 1 Pareto optimality 1 Pareto-Optimum 1 Pareto-optimal solutions 1 Permutation flowshop 1 Positive dependence 1 Risiko 1 Risk 1 Risk aggregation 1 Sports analytics 1 Stochastic process 1 Stochastischer Prozess 1 VaR-bounds 1
more ... less ...
Online availability
All
CC license 1 Free 1 Undetermined 1
Type of publication
All
Article 4
Type of publication (narrower categories)
All
Article in journal 3 Aufsatz in Zeitschrift 3
Language
All
English 3 Undetermined 1
Author
All
Madhushini, N. 2 Rajendran, Chandrasekharan 2 Haus, Utz-Uwe 1 Kaur, Prabhjot 1
Published in...
All
Decision analytics journal 1 European Journal of Industrial Engineering 1 Operations research letters 1 Technology operation management : TOM ; official publication of the Society of Operations Management 1
Source
All
ECONIS (ZBW) 3 RePEc 1
Showing 1 - 4 of 4
Cover Image
A lexicographic approach for solving bi-criteria bottleneck assignment problems
Kaur, Prabhjot - In: Decision analytics journal 10 (2024), pp. 1-11
The suitability of agents for tasks and ranked preference of tasks for agents play a significant role in problems where several agents are available to perform various tasks. The agents should be allocated to various tasks so that the corresponding assignment schedules must provide solution...
Persistent link: https://www.econbiz.de/10015101648
Saved in:
Cover Image
Bounding stochastic dependence, joint mixability of matrices, and multidimensional bottleneck assignment problems
Haus, Utz-Uwe - In: Operations research letters 43 (2015) 1, pp. 74-79
Persistent link: https://www.econbiz.de/10010486332
Saved in:
Cover Image
A bottleneck-assignment based branch-and-bound algorithm to minimize the makespan in an m-machine permutation flowshop
Madhushini, N.; Rajendran, Chandrasekharan - In: Technology operation management : TOM ; official … 3 (2012) 1/2, pp. 1-10
Persistent link: https://www.econbiz.de/10010248552
Saved in:
Cover Image
Branch-and-bound algorithms for scheduling in an m-machine permutation flowshop with a single objective and with multiple objectives
Madhushini, N.; Rajendran, Chandrasekharan - In: European Journal of Industrial Engineering 5 (2011) 4, pp. 361-387
solving a bottleneck assignment problem. The proposed algorithms are evaluated by solving problems of various sizes, and some …
Persistent link: https://www.econbiz.de/10009352917
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...