Generalized Job Shop Models with Multiple Objectives

具有多目标的广义车间模型

• 批准号: 9522938
• 负责人: Michael Pinedo
• 金额: $ 21.01万
• 依托单位: Columbia University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1996
• 资助国家: 美国
• 起止时间: 1996-01-01 至 1999-06-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9522938&HistoricalAwards=false
• 关键词: Generalized; Job; Shop; Models; Multiple

9522938 Pinedo This research addresses the problem of job scheduling in a job shop environment. Some special features of this research are (1) the consideration of flexible routing for the jobs to be scheduled, and (2) the consideration of multiple objectives. The development of procedures for parametric analysis of schedule quality will also be undertaken. The outcome of the algorithmic developments will be incorporated into prototype scheduling software that has been developed at Columbia University over the past four years. The term "routing flexibility" as used in this research is given two meanings. In the first case, routing flexibility refers to scheduling scenarios in which each workstation in the shop is populated with multiple machines. A job visiting a workstation can only be processed by one machine at the station. In the second case scenario, each job is characterized by an ordered sequence of operations or processing steps to be performed. Each operation or process step can be performed by a subset of all the machines in the shop. Subsets of machines that can perform the various process steps required by a job may overlap. In all the scheduling scenarios considered, the jobs may recirculate. Depending on the scheduling objective pursued, several modeling and solution approaches exist for solving scheduling problems. Most existing algorithms are focused on traditional production scenarios in which each job follows a fixed, prescribed route. Although, these earlier algorithms can serve the needs of many production situations, they fail to function effectively when flexible routing exists for jobs. The work done in this research will serve the needs of the modern day flexible shops as typified by flexible manufacturing systems (FMS). The outcome of the research will be a major contribution to scheduling theory and the expansion of the domain of applicability of scheduling algorithms in production shops.

9522938 Pinedo 这项研究解决了作业车间环境中的作业调度问题。这项研究的一些特点是（1）考虑要调度的作业的灵活路由，以及（2）考虑多个目标。还将开发进度质量参数分析程序。算法开发的成果将被纳入哥伦比亚大学过去四年开发的原型调度软件中。 本研究中使用的术语“路由灵活性”有两个含义。在第一种情况下，路由灵活性是指车间中每个工作站都装有多台机器的调度场景。访问工作站的作业只能由该工作站的一台机器处理。在第二种情况下，每个作业的特征是要执行的操作或处理步骤的有序序列。每个操作或流程步骤都可以由商店中所有机器的子集来执行。可以执行作业所需的各种工艺步骤的机器子集可能会重叠。在考虑的所有调度场景中，作业可能会重新循环。 根据所追求的调度目标，存在多种用于解决调度问题的建模和解决方法。大多数现有算法都专注于传统的生产场景，其中每项工作都遵循固定的规定路线。尽管这些早期的算法可以满足许多生产情况的需求，但当作业存在灵活的路由时，它们无法有效发挥作用。本研究完成的工作将满足以柔性制造系统 (FMS) 为代表的现代柔性商店的需求。研究成果将对调度理论和扩大生产车间调度算法的适用范围做出重大贡献。