PERMUTATION SCHEDULES FOR FLOW SHOPS WITH PRECEDENCE CONSTRAINTS

• 成果类型: Note
• 署名作者: EWACHA, K; RIVAL, I; STEINER, G
• 署名单位: McMaster University
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.38.6.1135
• 发表日期: 1990
• 页码: 1135-1139
• 关键词: PRODUCTION SCHEDULING; FLOW SHOPS WITH PRECEDENCE CONSTRAINTS

摘要

We show that permutation schedules are always optimal for regular, symmetric measures of performance for the m-machine flow shop with precedence constraints provided that processing times are identical for noncomparable jobs.