Abstract
The work force tour assignment problem in a U.S. Postal Service Sectional Center Facility consists of specifying the weekly tour start time, work center assignment, and mail class responsibility for each postal employee. Any efficient work force assignment must be made subject to a number of constraints including tour schedule requirements, work center capacities, mail arrival volumes, and mail flow patterns through the processing system. A heuristic algorithm of a building, or construction, nature is described which evaluates these many constraints in developing efficient work force tour assignment solutions. Once the problem setting and the heuristic algorithm are described, the use of the procedure is demonstrated by analyzing a hypothetical problem.
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.
