Abstract
This chapter addresses three main problems of the production planning area: Single Machine Scheduling (SMS), Parallel Machine Scheduling (PMS) and Flowshop Scheduling (FS). Many situations in production environments found in industries around the world can be modelled as one or a set of them (Baker 1974). It is easy to find dozens of problem variants in the literature due to different production constraints and objective functions. Due to the overwhelming number of combinations, we focused our discussion on only one of each problem class. They are: SMS with sequence-dependent setup times and with the objective of minimizing of the total tardiness. PMS with sequence-dependent setup times and minimization of the makespan. FS with families of jobs, sequence-dependent setup times and minimization of the makespan.
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.
