Question
A shipping company has n ships and provides service to n ports. Each ship Si has a schedule that says for each day of the
A shipping company has n ships and provides service to n ports. Each ship Si has a schedule that says for each day of the month (has m > n days), which port Si is visiting or Si is at sea; each ship visits each port for exactly one day during the month and no two ships is in the same port on the same day. The company wants to perform maintenance on all ships in a specific month via the following truncated schedule: for each ship Si, there will be some day when Si arrives in its scheduled port, Si remains at the port for the rest of the month for maintenance. Prove that given the schedule of each ship, a truncated schedule for each ship can always be found such that no two ships can be in the same port on the same day, and give an algorithm to find the truncated schedules.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started