论文信息 - Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks

Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks

We consider the problem to schedule n coupled-tasks in presence of treatment tasks. This work is motivated by the problem of data acquisition for a torpedo. In such context, we developp a O(nlog(n)) polynomial-time algorithm for a specific coupled-tasks scheduling problem.

Jean-Claude König | Gilles Simonin | Rodolphe Giroudeau

[1] Jean-Claude König,et al. Complexity and approximation for scheduling problem for a torpedo , 2009, 2009 International Conference on Computers & Industrial Engineering.

[2] Chris N. Potts,et al. Scheduling of coupled tasks with unit processing times , 2010, J. Sched..

[3] Philippe Baptiste. A Note on Scheduling Identical Coupled Tasks in Constant Time , 2008 .

[4] A. J. Orman,et al. On the Complexity of Coupled-task Scheduling , 1997, Discret. Appl. Math..

[5] Roy D. Shapiro,et al. Scheduling coupled tasks , 1980 .

[6] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[7] Benjamin Lev,et al. The role of internal storage capacity in fixed cycle production systems , 1980 .

[8] Gerhard Reinelt,et al. An exact algorithm for scheduling identical coupled tasks , 2004, Math. Methods Oper. Res..