Abstract
Abstract This paper presents a novel, mixed-integer programming model for scheduling of n independent jobs in a flexible flow shop (FFS) system with blocking processor, sequence-dependent setup times, and unrelated parallel machines. Due dates are uncertain in nature and assumed to be fuzzyness. The main objective is to maximize the weighted additive of the satisfaction level of meeting due dates. Since the problem is known to be NP-hard in strong sense, only a few test problems in small sizes is solved by the Lingo software package in order to show the validity of the proposed model. Finally, the computational results along with some directions for further studies are discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
