نتایج جستجو برای: lower bound
تعداد نتایج: 840706 فیلتر نتایج به سال:
Journal:
:RAIRO - Theoretical Informatics and Applications
2000
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
Journal:
:Journal of Computer and System Sciences
2010
Journal:
:American Economic Journal: Macroeconomics
2017
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید