Two-machine flowshop group scheduling problem

Two-machine flowshop group scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor20011295
Country: United Kingdom
Volume: 27
Issue: 10
Start Page Number: 975
End Page Number: 985
Publication Date: Sep 2000
Journal: Computers and Operations Research
Authors: ,
Keywords: optimization, combinatorial analysis
Abstract:

This paper considers a two-machine flowshop group scheduling problem. The jobs are classified into groups and the jobs in the same group must be processed in succession. Each group requires a set up time and removal time on both machines. A transportation time is required for moving the jobs from machine 1 to machine 2. The objective is to minimize the maximum completion time (makespan). A polynomial time algorithm is proposed to solve the problem. This generalizes the algorithms proposed by Baker and others.

Reviews

Required fields are marked *. Your email address will not be published.