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 problem"
Narrow search

Narrow search

Year of publication
Subject
All
Bottleneck 2 Engpass 2 Scheduling problem 2 Scheduling-Verfahren 2 Algorithm 1 Algorithmus 1 Bi-criteria bottleneck assignment problem 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 Non-linear programming 1 Operations Research 1 Operations research 1 Pareto efficiency 1 Pareto optimality 1 Pareto-Optimum 1 Permutation flowshop 1 Sports analytics 1 Theorie 1 Theory 1
more ... less ...
Online availability
All
CC license 1 Free 1
Type of publication
All
Article 2
Type of publication (narrower categories)
All
Article in journal 2 Aufsatz in Zeitschrift 2
Language
All
English 2
Author
All
Kaur, Prabhjot 1 Madhushini, N. 1 Rajendran, Chandrasekharan 1
Published in...
All
Technology operation management : TOM ; official publication of the Society of Operations Management 1
Source
All
ECONIS (ZBW) 2
Showing 1 - 2 of 2
Cover Image
A lexicographic approach for solving bi-criteria bottleneck assignment problems
Kaur, Prabhjot - 2024
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
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:
A service of the
zbw
FAQ-Assistent (beta)
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...