位置：成果数据库 > 期刊 > 期刊详情页
An Improved Binary Search Algorithm for the Multiple-Choice Knapsack Problem
  • ISSN号：0399-0559
  • 期刊名称：RAIRO - Operations Research
  • 时间：0
  • 页码：-
  • 相关项目：具有层次结构的多目标排序的可解性研究
作者： 何程|Joseph Y-T. Leung|Kangbok Lee|Michael L. Pinedo|
同期刊论文项目
具有层次结构的多目标排序的可解性研究
期刊论文 25
同项目期刊论文
有着连续加工约束的机器排序问题
Bicriteria scheduling on a series- batching machine to minimize maximum cost and makespan
Bicriteria Scheduling on a Series- Batching Machine to Minimize Makespan and Total Weighted Completi
Bounded Serial-Batching Scheduling for Minimi- zing Maximum Lateness and Makespan
The Bounded S ingle--M achine Serial-·Batchingon-·line Scheduling Problem with Fam ily Jobsto M inim
Preemptive Hierarchical scheduling with Release Date
BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN
基于重新排序的退化工件最小化总延误时间问题
Time-dependent scheduling with Two agents
带运输的单机序列分批协作排序问题
在限制时间偏差的条件下最小化总完工时间的平行分批重新排序问题
关于工件具有到达时间和拒绝的单机排序问题的改进算法
工件的运输和继列分批加工协作排序问题
最小化具有最大完工时间和到达时间的总拒绝费用的平行分批排序问题
Hierarchical Optimization with Double Due Dates on an Unbounded Parallel-Batching Machine to Minimiz
Rescheduling to Minimize Total Completion Time Under a Limit Time Disruption for the Parallel Batch
最小化时间表长的带有多个工件组有界继列批单机在线排序
Bicriteria Scheduling on a Series-Batching Machine to Minimize Makespan and Total Weighted Completion Time with Equal Length Job
BBM-Burgers方程解得衰减估计