Two-agent scheduling with agent specific batches on an unbounded serial batching machine
Two-agent scheduling with agent specific batches on an unbounded serial batching machine
复制标题
DOI：
10.1007/s10951-014-0410-0
复制
发表时间：
2014-12
影响因子：
2
通讯作者：
M. Kovalyov;A. Oulamara;A. Soukhal
中科院分区：
文献类型：
--
作者：
M. Kovalyov;A. Oulamara;A. Soukhal
研究了一类调度问题，其中两个智能体的作业在同一台串行无界机器上分批执行。在这台机器上，同一批工件同时完成，批处理时间等于其工件的总处理时间加上准备时间。每个智能体的目标是最小化一个只依赖于其任务完成时间的函数。问题是要找到一个时间表，最大限度地减少一个代理的目标函数，其他代理的目标函数不超过一个给定的阈值。该问题出现在优化产品整合业务的一个越库配送中心。多项式和伪多项式动态规划算法推导出的目标函数的各种组合的设置。
We study a scheduling problem, in which jobs of two agents are performed in agent specific batches on the same serial unbounded batching machine. On this machine, jobs of the same batch complete simultaneously, and the batch processing time is equal to the total processing time of its jobs plus a setup time. Each agent aims at minimizing a function which depends only on the completion times of its jobs. The problem is to find a schedule that minimizes the objective function of one agent, subject to the objective function of the other agent does not exceed a given threshold. The problem appears in optimizing product consolidation operations of a cross-docking distribution center. Polynomial and pseudo-polynomial dynamic programming algorithms are derived for settings with various combinations of the objective functions.