SCHEDULING AS A MULTIPERSON, MULTIPERIOD DECISION PROBLEM

We look at the issue of scheduling several jobs sequentially in a single facility as a multi-person decision problem, by making the assumption that a job cannot be performed unless some third party (labelled agent) is present. We introduce private information by assuming that the scheduler does not know the agent's valuation of time and extend the model by allowing the agent's private information to change over time. We conclude that reputation building takes place when the agent and the scheduler interact repeatedly.