摘要:

AbstractThis paper considers the job (lot) scheduling problem for two-stage flow shops in which the movement of transfer batches (sublots) from the first stage to the next are allowed. Set-up, processing and removal times are considered as separable and independent of the order in which jobs are processed at any of two stages. An optimal transfer batch sizing and scheduling algorithm which has an objective of minimizing the maximum flow time (makespan) is developed and demonstrated by a numerical example.

ISSN:0160-5682    

DOI:10.1057/jors.1994.221

出版商:Taylor&Francis    

年代:1994

数据来源: Taylor

摘要:

AbstractIt has previously been shown that nine of the most prominent procedures of interactive multiple objective programming can be considered as special cases of a common procedure called the unified algorithm. In this paper, we show how four additional procedures can be similarly included in the unified approach. Also, the paper presents a procedure-switching matrix that depicts the possibilities for switching from one procedure to another, one iteration to the next, in the unified algorithm if so directed by a user.

ISSN:0160-5682    

DOI:10.1057/jors.1994.222

出版商:Taylor&Francis    

年代:1994

数据来源: Taylor

ISSN:0160-5682    

DOI:10.1057/jors.1994.223

出版商:Taylor&Francis    

年代:1994

数据来源: Taylor

ISSN:0160-5682    

DOI:10.1057/jors.1994.225

出版商:Taylor&Francis    

年代:1994

数据来源: Taylor