Abstract
We tackle the makespan minimization coupled-tasks problem in presence of incompatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in the framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain, \(\ldots \)). In such context, we design efficient polynomial-time approximation algorithms according to different parameters of the scheduling problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Caprara, A., Kellerer, H., Pferschy, U.: A PTAS for the multiple subset sum problem with different knapsack capacities. Inf. Process. Lett. 73(3–4), 111–118 (2000)
Caprara, A., Kellerer, H., Pferschy, U.: The multiple subset sum problem. Siam J. Optim. 11(2), 308–319 (2000)
Caprara, A., Kellerer, H., Pferschy, U.: A 3/4-approximation algorithm for multiple subset sum. J. Heuristics 9(2), 99–111 (2003)
Darties, B., Simonin, G., Giroudeau, R., König, J.-C.: Scheduling stretched coupled-tasks with compatibilities constraints: model, complexity and approximation results for some class of graphs. Report, February 2014
Dawande, M., Kalagnanam, J., Keskinocak, P., Salman, F.S., Ravi, R.: Approximation algorithms for the multiple knapsack problem with assignment restrictions. J. Comb. Optim. 4(2), 171–186 (2000)
Edmonds, J.: Maximum matching and a polyhedron with \(0,1\) vertices. J. Res. Natl. Bur. Stand. 69B, 125–130 (1965)
Simonin, G., Darties, B., Giroudeau, R., König, J.C.: Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. J. Sched. 14(5), 501–509 (2011)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287–326 (1979)
Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22(4), 463–468 (1975)
Kellerer, H., Mansini, R., Pferschy, U., Speranza, M.G.: An efficient fully polynomial approximation scheme for the subset-sum problem. J. Comput. Syst. Sci. 66(2), 349–370 (2003)
König, J.-C., Simonin, G., Giroudeau, R.: Complexity and approximation for scheduling problem for coupled-tasks in presence of compatibility tasks. In: Project Management and Scheduling (2010)
Shapiro, R.D.: Scheduling coupled tasks. Naval Res. Logist. Q. 27, 477–481 (1980)
Acknowledgment
This work has been funded by the regional council of Burgundy.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Darties, B., Simonin, G., Giroudeau, R., König, JC. (2014). Coupled-Tasks in Presence of Bipartite Compatibilities Graphs. In: Fouilhoux, P., Gouveia, L., Mahjoub, A., Paschos, V. (eds) Combinatorial Optimization. ISCO 2014. Lecture Notes in Computer Science(), vol 8596. Springer, Cham. https://doi.org/10.1007/978-3-319-09174-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-09174-7_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09173-0
Online ISBN: 978-3-319-09174-7
eBook Packages: Computer ScienceComputer Science (R0)