By Topic

Flow shop scheduling problems with transportation and capacities constraints

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
$31 $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)
Oulamara, A. ; Lab. Recherche Operationnelle Leibniz, IMAG, Grenoble, France ; Soukhal, A.

In most manufacturing and distribution systems, semi-finished jobs are transferred from one processing facility to another and finished jobs are delivered to customers or warehouse by vehicles such as trucks. The paper investigates flow shop scheduling problems that explicitly consider constraints on both transportation and buffer capacities. These elements enable the flexible manufacturing systems (FMS) to process different types of parts. The finished jobs leave the processing facility to be delivered to customers or sent to warehouses by vehicles such as trucks. The objective function that is considered is makespan C max. We prove that this problem is strongly NP-hard when the capacity of truck is equal to two with unlimited buffer behind each machine. This problem with additional constraints, such as blocking, is also proved to be NP-hard

Published in:

Systems, Man, and Cybernetics, 2001 IEEE International Conference on  (Volume:4 )

Date of Conference:

2001