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.
机构:
Samsung Elect Co Ltd, Device Solut Business, Syst Engn Team, Yongin 17113, Gyeonggi Do, South KoreaSamsung Elect Co Ltd, Device Solut Business, Syst Engn Team, Yongin 17113, Gyeonggi Do, South Korea
Lee, Ju-Yong
Bang, June-Young
论文数: 0引用数: 0
h-index: 0
机构:
Sungkyul Univ, Dept Ind Management Engn, Anyang Si 14097, Gyeonggi Do, South KoreaSamsung Elect Co Ltd, Device Solut Business, Syst Engn Team, Yongin 17113, Gyeonggi Do, South Korea
机构:
Shanghai Univ, Sch Management, Dept Business Adm, Shanghai 200444, Peoples R ChinaShanghai Univ, Sch Management, Dept Business Adm, Shanghai 200444, Peoples R China
Zhong, Weiya
Shi, Yun
论文数: 0引用数: 0
h-index: 0
机构:
Shanghai Univ Finance & Econ, Sch Informat Management & Engn, Shanghai 200433, Peoples R ChinaShanghai Univ, Sch Management, Dept Business Adm, Shanghai 200444, Peoples R China