Abstract
This paper tackles a cyclic scheduling problem with disjunctive resources called the recurrent job-shop. It is aimed to show structural properties of feasible schedules on which efficient algorithms could be based. The problem is proven to be NP-hard and is formalized as a mixed linear program. We prove that any feasible solution is associated with a valuation called a conservative height on the graph of constraints. Computing the critical circuit provides the best solution associated with a given conservative height. Bounds on the feasible heights and on the throughput based on these properties are then stated. Finally we propose a branch and bound enumeration procedure and two heuristics solving the problem. We report numerical experiments.
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.
