23
Views
4
CrossRef citations to date
0
Altmetric
General Paper

Complexity of scheduling of coupled tasks with chains precedence constraints and any constant length of gap

&
Pages 524-529 | Received 01 Nov 2010, Accepted 01 Feb 2011, Published online: 21 Dec 2017

References

  • AgeevAABaburinAEApproximation algorithms for UET scheduling problems with exact delaysOpns Res Lett200735453354010.1016/j.orl.2006.09.006
  • AhrDBekesiJGalambosGOswaldMReineltGAn exact algorithm for scheduling identical coupled tasksMath Method Opns Res200459219320310.1007/s001860300328
  • BakerKIntroduction to Sequencing and Scheduling1974
  • BékésiJGalambosGOswaldMReineltGImproved analysis of an algorithm for the coupled task problem with uet jobsOpns Res Lett2009372939610.1016/j.orl.2008.11.002
  • BlazewiczJEckerKPeschESchmidtGWeglarzJHandbook of Scheduling. From Theory to Applications2007
  • BlazewiczJEckerKKisTPottsCNTanasMWhiteheadJScheduling of coupled tasks with unit processing timesJ Sched201013545346110.1007/s10951-010-0167-z
  • BraunerNFinkeGLehoux-LebacqueVPottsCWhiteheadJScheduling of coupled tasks and one-machine no-wait robotic cellsComput Opns Res200936230130710.1016/j.cor.2007.10.003
  • BruckerPScheduling Algorithms2001
  • BruckerPKnustSComplexity results for single-machine problems with positive finish-start time-lagsOsnabrucker Schriften zur Mathematik, Reihe P Nr1998202299316
  • EckerKTanasMComplexity of scheduling of coupled tasks with chains precedence constraints and constant even length of the gapFound Comput Decision Sci2007323199212
  • Gupta JND (1994). Single Facility Scheduling with Two Operations per Job and Time-lags. preprint.
  • Lehoux-Lebacque V, Brauner N and Finke G (2009). Identical coupled tasks scheduling: Polynomial complexity of the cyclic case. Les cahiers Leibnitz 179.
  • LeungJHandbook of Scheduling2004
  • Li H and Zhao H (2007). Scheduling coupled tasks on a single machine. In: Kendall G, Tan KC, Burke EK and Smith S (eds). IEEE Symposium on Computational Intelligence in Scheduling, Honolulu, Hawaii, pp 137–142.
  • OrmanAJPottsCNOn the complexity of coupled-task schedulingDiscrete Appl Math19977214115410.1016/S0166-218X(96)00041-8
  • OrmanAJPottsCNShahaniAKMooreARScheduling for the control of a multifunctional phased array radar systemEur J Opl Res199690132510.1016/0377-2217(95)00307-X
  • OrmanAJShahaniAKMooreARModelling for the control of a complex radar systemComput Opns Res19982523924910.1016/S0305-0548(97)00047-6
  • PottsCNWhiteheadJDHeuristics for a coupled-operation scheduling problemJ Opl Res Soc200758101375138810.1057/palgrave.jors.2602272
  • ShapiroRDScheduling coupled tasksNav Res Logist Q19802747748110.1002/nav.3800270312
  • Simonin G, Darties B, Giroundeau R and Konig JC (2009). Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. In: Blazewicz J, Drozdowski M, Kendall G and McCollum B (eds). Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10–12 August, Dublin, Ireland, pp 378–388.
  • Whitehead JD (2002). Scheduling and layout in flexible manufacturing systems. PhD Thesis, University of Southampton, UK.
  • YuWThe Two-machine Flow Shop Problem with Delays and the One-machine Total Tardiness Problem1996

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.