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

被引:13
|
作者
Gerstl, Enrique [1 ]
Mosheiov, Gur [1 ]
机构
[1] Hebrew Univ Jerusalem, Sch Business Adm, IL-91905 Jerusalem, Israel
关键词
Scheduling; Sequencing; Deterministic; Flowshop; Makespan; Flowtime; COMMON 2ND-STAGE MACHINE; 2 PART TYPES; DEDICATED MACHINES; SHOP; JOB; TIME; OPERATIONS; ALGORITHM; SELECTION;
D O I
10.1007/s10951-013-0343-z
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
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
页数:12
相关论文
共 50 条