Complexity of Scheduling Problem in Single-Machine Flexible Manufacturing System with Cyclic Transportation and Unlimited Buffers

Title
Complexity of Scheduling Problem in Single-Machine Flexible Manufacturing System with Cyclic Transportation and Unlimited Buffers
Authors
Keywords
Flexible manufacturing system, Single machine, One depot, One vehicle, NP-hardness proof, Approximation algorithm, 90B35, 11Y16
Journal
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
Volume 173, Issue 3, Pages 1042-1054
Publisher
Springer Nature
Online
2017-01-13
DOI
10.1007/s10957-016-1056-1

Ask authors/readers for more resources

Reprint

Contact the author

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now