A Branch-and-Bound Algorithm for the Continuous-Process Job-Shop Scheduling Problem

A Branch-and-Bound Algorithm for the Continuous-Process Job-Shop Scheduling Problem
复制标题

连续过程作业车间调度问题的分支定界算法

DOI：
--
复制
发表时间：
1970
期刊：
影响因子：
--
通讯作者：
Richard Jean
Richard Jean
中科院分区：
--
文献类型：
--
作者：
Bozoki George;Richard Jean

文献摘要

被引文献

相似文献

连续工序车间调度问题（CPJS）的典型问题是：（1）有一组M台机器或生产设备;（2）有一组N个工件需要通过这些机器按照一个工艺矩阵进行加工;（3）与一个给定工件相关的机器必须同时完成该工件;（4）每个工件都需要预定的生产时间;（5）目标是确定一个使所有工件的总完工时间（最大完工时间）最小的生产计划。给出了求解该问题的一个分枝定界型算法。
Abstract The continuous-process job-shop scheduling problem (CPJS) arises typically in the following way: (1) a set of M machines or production facilities are available; (2) a set of N jobs are to be processed through these machines in accordance with a technological matrix; (3) the machines associated with a given job must all be used simultaneously for the completion of this job; (4) a predetermined production time is required for each job; (5) the objective is to determine a production schedule which minimizes the total completion time (makespan) of all jobs. A branch-and-bound type algorithm for the solution of the (CPJS) problem is presented.