Deterministic and stochastic scheduling with teamwork tasks

Xiaoqiang Cai, Xian Zhou

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f1(C1), f2(C2), … , fn(Cn)), where fi(Ci) is a general, nondecreasing function of the completion time Ci of task i. We show that the optimal sequence to minimize the maximum cost MC = max fi(Ci) can be derived by a simple rule if there exists an order f1(t) ≤ … ≤ fn(t) for all t between the functions {fi(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ fi(Ci) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived.
Original languageEnglish
Pages (from-to)818-840
Number of pages23
JournalNaval Research Logistics
Volume51
Issue number6
DOIs
Publication statusPublished - 2004
Externally publishedYes

Keywords

  • scheduling
  • teamwork tasks
  • general cost functions
  • maximum cost
  • total completion time
  • stochastic scheduling
  • stochastic criteria

Fingerprint Dive into the research topics of 'Deterministic and stochastic scheduling with teamwork tasks'. Together they form a unique fingerprint.

Cite this