Abstract
In this paper, the authors pose the principles of a temporal decomposition method for the single machine scheduling problem. A set of feasible schedules is characterised by means of constraint-based analysis rules. These rules permit the determination of the feasible locations of each activity in a sequence, represented by the rank interval. The temporal properties pointed out serve to support the decision-making in large-scale problems and generate an interesting solution more rapidly.
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.
