By Topic

Two-machine flowshop scheduling problem with transportation and blocking features

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hua Gong ; The Logistics Institute, Northeastern University, Shenyang 110004, China ; Lixin Tang

We consider a coordinated scheduling problem with transportation and blocking features on two-machine flowshop where the first machine processes jobs in batches (i.e., a single batching machine) while the second machine processes jobs individually. The finished jobs on the batching machine are transported immediately to the second machine when the second machine is available, otherwise the jobs stay there. The objective is to minimize the sum of the makespan and total blocking time. We show that this problem is strongly NP-hard by a reduction from 3-partition problem. We further give a greedy heuristic and analyze its asymptotic worst-case ratio is equal to the capacity of the batching machine. This performance analysis established the maximum deviation from optimality that can occur for a given heuristic.

Published in:

2008 Chinese Control and Decision Conference

Date of Conference:

2-4 July 2008