Two-agent Scheduling with Setup Time
In this paper, we focus on the following situation. There are two agents, each with a set of jobs. The agents have to schedule their jobs on a single machine, and each agent wishes to minimize an objective function which depends on its own jobs completion times. Besides, the jobs belong to n classes. A setup time is incurred whenever there is a switch from processing a job in one class to a job in another class. In this paper we assume that all jobs have same setup time and same processing time. We address finding the optimal solution for one agent with a constraint on the other agents cost function. As for different values of constraint, we give scheduling methods respectively.
two-agent setup time constrained optimal schedule single machine
LIU Xiaohui LIN Daorong
College of Science, Nantong University, P.R.China, 226007
国际会议
威海
英文
664-668
2010-07-24（万方平台首次上网日期，不代表论文的发表时间）