The optimal number of used machines in a two-stage flexible flowshop scheduling problem

被引:0
|
作者
Enrique Gerstl
Gur Mosheiov
机构
[1] The Hebrew University,School of Business Administration
来源
Journal of Scheduling | 2014年 / 17卷
关键词
Scheduling; Sequencing; Deterministic; Flowshop; Makespan; Flowtime;
D O I
暂无
中图分类号
学科分类号
摘要
We study practical scheduling problems with a major decision referring to the number of machines to be used. We focus on a two-stage flexible flowshop, where each job is processed on the first (critical) machine, and then continues to one of the second-stage parallel machines. Jobs are assumed to have identical processing times, and are processed in batches. A setup time is required when starting a new batch. We consider two objective functions: minimum makespan and minimum flowtime. In both cases, a closed form expression for the optimal number of machines to be used is introduced, and a unique and unusual sequence of decreasing batch sizes is shown to be optimal.
引用
收藏
页码:199 / 210
页数:11
相关论文
共 50 条