摘要

Competitive multi-agent scheduling has attracted increasingly more and more researchers' attention recently. Inspired by the observation that a machine may not be always available during the whole planning horizon, we study a new category of scheduling problems where competitive two-agent scheduling and flexible periodic maintenance are considered simultaneously. As a start of this new topic, we focus our attention on establishing mathematical programming models for some of these scheduling problems. Specifically, we first present a framework for the general problem, and then construct various constraint blocks, which include common constraint block, constraint block for the relationship between start times and completion times of the jobs, constraint block for the relationship between the jobs and the maintenance activities, constraint block for various regular objective functions of the two agents, constraint block for the ranges of variables, and constraint block for the other constraint factors. One can establish mathematical programming models for at least 512 scheduling scenarios of this category easily based on these constraint blocks. The work presented in this paper is extremely useful for the production managers and software developers who are seeking for optimization models to generate optimal schedules for their problems.