Abstract
The paper deals with cyclic production system providing a mixture of various products, each of which is manufactured by unique sequence of operations on machines called job. The aim is to find the cyclic schedule of minimal cycle length under “no store” policy. The problem belongs to scheduling area, is called the job shop scheduling problem with no-store constraints, is strongly NP-hard, and has been considered very rarely in the literature. In this paper there are shown: mathematical model of the problem, some of its theoretical properties, two-level solution method with special algorithm based on paths in a graph on the lower level and TSAB-relative procedure on the upper level.
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.
