Abstract
In various manufacturing and computing environments there may be certain time intervals, during which processing may continue but may not be initiated. We examine the problem of off-line scheduling in the presence of such forbidden zones. The problem is closely related to a one-dimensional open-end bin packing problem. We prove that the decision version of the problem is strongly NP-complete and then establish bounds on the asymptotic performance ratio of an O(nlogn) approximation algorithm for a special case, and test it numerically. We present a further heuristic for a non-regular case and test it empirically.
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.
