Minimizing production flow time in a process and assembly job shop
Minimizing production flow time in a process and assembly job shop
复制标题
DOI：
10.1080/002075498192922
复制
发表时间：
1998-08
影响因子：
9.2
通讯作者：
D. Cummings;Mckoy P. J. Egbelu
中科院分区：
文献类型：
--
作者：
D. Cummings;Mckoy P. J. Egbelu
调度是生产系统规划和运行中最重要的问题之一，但在中型到大型车间，生成一致的良好调度已被证明是极其困难的。问题是，最优调度解决方案涉及昂贵的和不切实际的枚举程序。在文献中，大多数调度问题只解决串行或顺序操作的工件。他们很少考虑同时涉及加工和装配操作的工作。这种对涉及加工和装配的调度问题缺乏关注的情况与大多数车间通常会发现的情况相反。在本文中，一组N个最终产品的M台机器上的作业车间环境中，涉及加工和装配操作的调度问题。追求的目标是最小化生产流程时间（makespan）。一个数学模型的开发，以获得最佳的解决方案。因为这种模式…
Scheduling is one of the most important issues in the planning and operation of production systems, but in medium to large shops, the generation of consistently good schedules has proven to be extremely difficult. The problem is that optimal scheduling solutions involve costly and impractical enumeration procedures. In the literature, most scheduling problems only address jobs with serial or sequential operations. Rarely do they consider jobs in which machining and assembly operations are simultaneously involved. This lack of attention to scheduling problems that involve both machining and assembly goes against what one would normally find in most job shops. In this paper, the problem of scheduling a set of N final products on M machines in a job shop environment that involve both machining and assembly operations is addressed. The objective pursued is the minimization of production flow time (makespan). A mathematical model is developed in an effort to obtain optimal solutions. Because this type of model...